Theory of recursive functions and effective computability

Cambridge: MIT Press (1987)
  Copy   BIBTEX

Abstract

Reprint of the 1967 edition

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,038

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Computability and Logic.George Boolos, John Burgess, Richard P. & C. Jeffrey - 1980 - New York: Cambridge University Press. Edited by John P. Burgess & Richard C. Jeffrey.
Generalized weak presentations.Alexandra Shlapentokh - 2002 - Journal of Symbolic Logic 67 (2):787-819.
Computability and recursion.Robert I. Soare - 1996 - Bulletin of Symbolic Logic 2 (3):284-321.
Accessible recursive functions.Stanley S. Wainer - 1999 - Bulletin of Symbolic Logic 5 (3):367-388.
Subrecursion: functions and hierarchies.H. E. Rose - 1984 - New York: Oxford University Press.
Computability & unsolvability.Martin Davis - 1958 - New York: Dover Publications.

Analytics

Added to PP
2009-01-28

Downloads
120 (#150,013)

6 months
12 (#214,382)

Historical graph of downloads
How can I increase my downloads?

References found in this work

No references found.

Add more references