David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
Cambridge University Press (1996)
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 for specialists and non-specialists alike.
|Categories||categorize this paper)|
|Buy the book||$26.46 used (75% off) $82.36 new (22% off) $104.99 direct from Amazon Amazon page|
|Call number||QA9.6.C66 1996|
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
|Through your library|
of Minimal Degrees Below, Yates , Who Obtained a Low Minimal Degree as a Corollary to His Con.
References found in this work BETA
No references found.
Citations of this work BETA
No citations found.
Similar books and articles
Wolfgang Maass (1978). Contributions to [Alpha]- and [Beta]-Recursion Theory. Minerva-Publikation.
Nigel Cutland (1980). Computability, an Introduction to Recursive Function Theory. Cambridge University Press.
Piergiorgio Odifreddi (1989). Classical Recursion Theory: The Theory of Functions and Sets of Natural Numbers. Sole Distributors for the Usa and Canada, Elsevier Science Pub. Co..
Robert I. Soare (1996). Computability and Recursion. Bulletin of Symbolic Logic 2 (3):284-321.
Jens Erik Fenstad & Peter G. Hinman (eds.) (1974). Generalized Recursion Theory. New York,American Elsevier Pub. Co..
Raymond M. Smullyan (1993). Recursion Theory for Metamathematics. Oxford University Press.
Simon Thompson (1985). Axiomatic Recursion Theory and the Continuous Functionals. Journal of Symbolic Logic 50 (2):442-450.
Added to index2009-01-28
Total downloads17 ( #110,877 of 1,410,137 )
Recent downloads (6 months)3 ( #75,890 of 1,410,137 )
How can I increase my downloads?