Computability, Enumerability, Unsolvability: Directions in Recursion Theory by S

Description: Computability, Enumerability, Unsolvability by S.B. Cooper The fundamental ideas concerning computation and recursion naturally find their place at the interface between logic and theoretical computer science. The contributions in this book, by leaders in the field, provide a picture of current ideas and methods in the ongoing investigations into the pure mathematical foundations of computability theory. The topics range over computable functions, enumerable sets, degree structures, complexity, subrecursiveness, domains and inductive inference. A number of the articles contain introductory and background material which it is hoped will make this volume an invaluable resource. FORMAT Paperback LANGUAGE English CONDITION Brand New Publisher Description The fundamental ideas concerning computation and recursion naturally find their place at the interface between logic and theoretical computer science. The contributions in this book provide a picture of current ideas and methods in the ongoing investigations into the structure of the computable and noncomputable universe. A number of the articles contain introductory and background material that will make the volume an invaluable resource for mathematicians and computer scientists. Table of Contents Minimal degrees below O and the jump operator B. Cooper; Boolean algebras and ideals associated with the lattice of r.e. sets L. Harrington; Codable sets L. Harrington and R. Soare; Subrecursion theories A. Heaton and S. Wainer; An appraoch to lattice embaddings M. Lerman; A hierarchy of domains with totality, but without density D. Norman; Inductive inference P. Odifreddi; The discontinuity of the Slaman-Soare phenomenon X. YI; Recursive enumerability M. Arslanov; Resource bounded gereicity concepts K. Ambos-Spies; The Medvedev lattice of degrees of difficulty A. Sorbi; On the number of countable models II G. Sacks. Promotional "Headline" Provides a picture of current ideas and methods in the ongoing investigations into the pure mathematical foundations of computability theory. Description for Bookstore The fundamental ideas concerning computation and recursion naturally find their place at the interface between logic and theoretical computer science. The contributions in this book, by leaders in the field, provide a picture of current ideas and methods in the ongoing investigations into the pure mathematical foundations of computability theory. Description for Library The fundamental ideas concerning computation and recursion naturally find their place at the interface between logic and theoretical computer science. The contributions in this book, by leaders in the field, provide a picture of current ideas and methods in the ongoing investigations into the pure mathematical foundations of computability theory. Details ISBN0521557364 Short Title COMPUTABILITY ENUMERABILITY UN Publisher Cambridge University Press Language English ISBN-10 0521557364 ISBN-13 9780521557368 Media Book Format Paperback DEWEY 511.35 Year 1996 Publication Date 1996-03-31 Imprint Cambridge University Press Subtitle Directions in Recursion Theory Place of Publication Cambridge Country of Publication United Kingdom Edited by S. B. Cooper Affiliation University of Chicago Author S.B. Cooper Pages 356 Series London Mathematical Society Lecture Notes Illustrations Worked examples or Exercises DOI 10.1604/9780521557368 Series Number 224 Audience College/Higher Education UK Release Date 1996-01-11 AU Release Date 1996-01-11 NZ Release Date 1996-01-11 We've got this At The Nile, if you're looking for it, we've got it. With fast shipping, low prices, friendly service and well over a million items - you're bound to find what you want, at a price you'll love! TheNile_Item_ID:91369415;

Price: 145.56 AUD

Location: Melbourne

End Time: 2025-01-07T02:32:35.000Z

Shipping Cost: 11.06 AUD