Graduate studies at Western
Cambridge University Press (1996)
|Abstract||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||$40.75 used (59% off) $56.35 new (43% off) $88.20 direct from Amazon (10% off) Amazon page|
|Call number||QA9.6.C66 1996|
|Through your library||Configure|
Similar books and articles
Wolfgang Maass (1978). Contributions to [Alpha]- and [Beta]-Recursion Theory. Minerva-Publikation.
Simon Thompson (1985). Axiomatic Recursion Theory and the Continuous Functionals. Journal of Symbolic Logic 50 (2):442-450.
Raymond M. Smullyan (1993). Recursion Theory for Metamathematics. Oxford University Press.
Jens Erik Fenstad & Peter G. Hinman (eds.) (1974). Generalized Recursion Theory. New York,American Elsevier Pub. Co..
Robert I. Soare (1996). Computability and Recursion. Bulletin of Symbolic Logic 2 (3):284-321.
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..
Nigel Cutland (1980). Computability, an Introduction to Recursive Function Theory. Cambridge University Press.
Added to index2009-01-28
Total downloads13 ( #95,639 of 739,396 )
Recent downloads (6 months)0
How can I increase my downloads?