Theory of Recursive Functions and Effective Computability
Mit Press (1987)
| Abstract | This article has no associated abstract. (fix it) | |||||||||
| Keywords | Recursive functions Computable functions | |||||||||
| Categories | ||||||||||
| Buy the book | $39.03 new (21% off) $39.06 direct from Amazon (21% off) Amazon page | |||||||||
| Call number | QA9.615.R64 1987 | |||||||||
| ISBN(s) | 0262680521 | |||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,709 |
| External links | This entry has no external links. Add one. |
| Through your library | Configure |
Similar books and articlesNigel Cutland (1980). Computability, an Introduction to Recursive Function Theory. Cambridge University Press.
H. E. Rose (1984). Subrecursion: Functions and Hierarchies. Oxford University Press.
F. W. Kroon & W. A. Burkhard (1990). On a Complexity-Based Way of Constructivizing the Recursive Functions. Studia Logica 49 (1):133 - 149.
Stanley S. Wainer (1999). Accessible Recursive Functions. Bulletin of Symbolic Logic 5 (3):367-388.
Robert I. Soare (1996). Computability and Recursion. Bulletin of Symbolic Logic 2 (3):284-321.
Alexandra Shlapentokh (2002). Generalized Weak Presentations. Journal of Symbolic Logic 67 (2):787-819.
George Boolos, John Burgess, Richard P. & C. Jeffrey (2007). Computability and Logic. Cambridge University Press.
George Boolos (2007). Computability and Logic. Cambridge University Press.
Analytics
Monthly downloads
Sorry, there are not enough data points to plot this chart.
|
Added to index2009-01-28Total downloads0Recent downloads (6 months)0How can I increase my downloads? |
My notes
Discussion
