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||$13.24 used (85% off) $68.02 new (20% off) $83.77 direct from Amazon (1% off) Amazon page|
|Call number||QA9.6.C66 1996|
References found in this work BETA
No references found.
Citations of this work BETA
No citations found.
Similar books and articles
Contributions to [Alpha]- and [Beta]-Recursion Theory.Wolfgang Maass - 1978 - Minerva-Publikation.
Axiomatic Recursion Theory and the Continuous Functionals.Simon Thompson - 1985 - Journal of Symbolic Logic 50 (2):442-450.
Computability Theory, Semantics, and Logic Programming.Melvin Fitting - 1987 - Clarendon Press.
Generalized Recursion Theory.Jens Erik Fenstad & Peter G. Hinman (eds.) - 1974 - New York: American Elsevier Pub. Co..
Classical Recursion Theory: The Theory of Functions and Sets of Natural Numbers.Piergiorgio Odifreddi - 1989 - Sole Distributors for the Usa and Canada, Elsevier Science Pub. Co..
Computability, an Introduction to Recursive Function Theory.Nigel Cutland - 1980 - Cambridge University Press.
Computability Theory: An Introduction to Recursion Theory.Herbert B. Enderton - 2011 - Academic Press.
Added to index2009-01-28
Total downloads19 ( #259,805 of 2,171,802 )
Recent downloads (6 months)1 ( #326,702 of 2,171,802 )
How can I increase my downloads?