Handbook of Computability Theory
Edward R. Griffor (ed.)
Elsevier (1999)
Abstract
The chapters of this volume all have their own level of presentation. The topics have been chosen based on the active research interest associated with them. Since the interest in some topics is older than that in others, some presentations contain fundamental definitions and basic results while others relate very little of the elementary theory behind them and aim directly toward an exposition of advanced results. Presentations of the latter sort are in some cases restricted to a short survey of recent results (due to the complexity of the methods and proofs themselves). Hence the variation in level of presentation from chapter to chapter only reflects the conceptual situation itself. One example of this is the collective efforts to develop an acceptable theory of computation on the real numbers. The last two decades has seen at least two new definitions of effective operations on the real numbers.Call number
QA9.59.H36 1999
ISBN(s)
0444898824 9780444898821 0444547010
My notes
Chapters
358 PG. Hinman.J. Barwise, L. Blum, M. Shub, S. Smale, Fr Drake, Ss Wainer, E. Engeler, Hm Friedman, Ro Gandy & Cme Yates
R. PETER [1934] Uber den Zussammenhang der verschiedenen Begriffe der rekursiven Funktion, Math. Ann.Sc Kleene, El Post, M. Kline, M. Lerman, L. Lowenheim, D. Normann, P. Odifreddi, G. Peano, Cs Peirce & R. Penrose
Ge Sacks and sg Simpson [1972] the oz-finite injury method, Ann. Math. Logic, 4, pp. 323-367.M. Magidor, S. Shelah, J. Stavi, M. Mytilinaios, Ta Slaman, Jb Paris & H. la KirbyRogers Jr
He rose and jc Shepherdson.Yn Moschovakis, J. Moldestad, V. Stoltenberg-Hansen, Jv Tucker, E. Nagel, P. Suppes, A. Tarski & Ra Platek
Similar books and articles
Computability, Enumerability, Unsolvability: Directions in Recursion Theory.S. B. Cooper, T. A. Slaman & S. S. Wainer (eds.) - 1996 - Cambridge University Press.
Alan Turing and the foundations of computable analysis.Guido Gherardi - 2011 - Bulletin of Symbolic Logic 17 (3):394-430.
Computability and Logic.George Boolos, John Burgess, Richard P. & C. Jeffrey - 2002 - Cambridge University Press.
Degrees of Unsolvability of Continuous Functions.Joseph S. Miller - 2004 - Journal of Symbolic Logic 69 (2):555 - 584.
A natural axiomatization of computability and proof of Church’s thesis.Nachum Dershowitz & Yuri Gurevich - 2008 - Bulletin of Symbolic Logic 14 (3):299-350.
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.
Analytics
Added to PP
2009-01-28
Downloads
35 (#336,103)
6 months
1 (#451,971)
2009-01-28
Downloads
35 (#336,103)
6 months
1 (#451,971)
Historical graph of downloads