Turing’s “Oracle”: From Absolute to Relative Computability – and Back

The Space of Mathematics: Philosophical, Epistemological, and Historical Explorations

Volumn , Issue , 2012, Pages 314-348

  Feferman, Solomon ^a  

^a NONE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 71149096160     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1515/9783110870299.314     Document Type: Chapter

References (63)

1. A. Aho / J. E. Hopcroft / J. Ullman (1974), The design and analysis of computer algorithms, Addison-Wesley.
2. S. Alagic / M. A. Arbib (1978), The design of well-structured and correct programs, Springer-Ver lag.
3. T. P. Baker / J. Gill / R. Solovay (1975), “Relativizations of the Ρ = NP question�?, SIAM J. Comp. 4, 431-442.
4. J. L. Balcázar / J. Díaz / J. Gabauró (1988), Structural complexity I, Springer-Verlag.
5. J. Barwise (1975), Admissible sets and structures, Springer-Verlag.
6. J. Barwise (1977) (ed.). Handbook of mathematical logic, North-Holland.
7. A. K. Chandra / D. Harel (1980), “Computable queries for relational data bases�?, J. Comp. Syst. Sci. 21, 156-178.
8. A. Church (1936), “An unsolvable problem of elementary number theory�?, Amer. J. Math. 58, 345-363, Reprinted in Davis 1965.
9. S. A. Cook (1971), “The complexity of theorem proving procedures�?, Proc. 3d ACM STOC, 151-158.
10. M. Davis (1965), The undecidable. Basic papers on undecidable propositions, unsolvable problems and computable functions, Raven Press.
11. M. Davis (1982), “Why Godei didn’t have Church’s Thesis�?, Information and Control 54, 3-24.
12. S. Feferman (1977), “Inductive schemata and recursively continuous functionals�? In Logic Colloquium’76, North-Holland, 373-392.
13. S. Feferman (1988), “Turing in the land of 0(z)". In: Herken 1988, 113-147.
14. S. Feferman (1990), “Polymorphic typed λ-calculi in a type-free axiomatic framework�?. In: Logic and Computation, Contemporary Maths. 104, AMS, 101-136.
15. S. Feferman (1991), “Logics for termination and correctness of functional programs�?. In Logic from Computer Science, MSRI Publications, Springer-Verlag, 95-127.
16. J. E. Fenstad (1980), General recursion theory: An axiomatic approach, Springer -Verlag.
17. J. E. Fenstad / R. Gandy / G. Sacks (1978) (eds.). Generalized recursion theory II, North-Holland.
18. J. E. Fenstad / P. Hinman (1974) (eds), Generalized recursion theory, North-Holland.
19. M. Fitting (1987), Computability theory, semantics and logic programming, Oxford UP.
20. R. M. Friedberg (1957), “Two recursively enumerable sets of incomparable degrees of unsolvability (solution of Post’s problem 1944)", Proc. Nat. Acad. Sci. 43, 236-238.
21. H. Friedman (1971), “Algorithmic procedures, generalized Turing algorithms, and elementary recursion theory�?. In: Logic Colloquium’69, North-Holland, 361-389.
22. R. Gandy (1980), “Church’s thesis and principles for mechanisms�?. In: The Kleene Symposium, North-Holland, 123-148.
23. R. Gandy (1988), “The confluence of ideas in 1936 ". In: Herken 1988, 55-111.
24. M. Garey / D. Johnson (1979), Computers and intractability: A guide to the theory of �? Ρ-Completeness, W. H. Freeman and Co.
25. K. Godei (1986), Collected Works Volume I : Publications 1929-1936, Oxford UP.
26. K. Godei (1990), Collected Works Volume II : Publications 1938-1974, Oxford UP.
27. D. Harel (1987), Algorithmes: The spirit of computing, Addison-Wesley.
28. R. Herken (1988) (ed.). The universal Turing machine. A half-century survey, Oxford UP.
29. P. Hinman (1978), Recursion-theoretic hierarchies, Springer-Verlag.
30. A. Hodges (1983), Alan Turing: The enigma, Simon and Schuster.
31. A. Kechris / Y. Moschovakis (1977), “Recursion in higher types�?. In: Barwise 1977, 681-737.
32. S. C. Kleene (1938), “On notation for ordinal numbers�?, J. Symbolic Logic 3, 150-155.
33. S. C. Kleene (1952), Introduction to metamathematics, North-Holland.
34. S. C. Kleene (1959), “Recursive functional and quantifiers of finite types I�?, Trans. A. M. S. 91, 1-52.
35. S. C. Kleene (1959a), “Countable functionals�?. In: Constructivity in mathematics, North-Holland, 81-100.
36. S. C. Kleene (1981), “Origins of recursive function theory�?. Annals of the History of Computing 3, 52-67.
37. S. C. Kleene / E. Post (1954), “The upper semi-lattice of degrees of recursive unsolvability�?. Annals of Math. 59, 379-407.
38. G. Kreisel (1959), “Interpretation of analysis by means of constructive functionals of finite types�?. In: Constructivity in mathematics, North-Holland, 101-128.
39. G. Kreisel (1971), “Some reasons for generalizing recursion theory�?. In: Logic colloquium’69, North-Holland, 139-198.
40. M. Lerman (1983), Degrees of unsolvability. Springer-Ver lag.
41. W. Maass / T. Slaman (1989), “Some problems and results in the theory of actually computable functions�?. In: Logic Colloquium’88, North-Holland, 79-89.
42. J. Mitchell / R. Harper (1988), “The essence of ML�?, Proc. 15th ACM / POPL, 28-46.
43. J. Mitchell / G. Plotkin (1984), “Abstract types have existential type�?, Proc. 12th ACM / POPL, 37-51.
44. Y. Moschovakis (1984), “Abstract recursion as a foundation for the theory of algorithms�?. In: Computation and Proof Theory, Lecture Notes in Maths. 1104, 289-364.
45. P. Odifreddi (1989), Classical recursion theory, North-Holland.
46. P. Odifreddi (1990) (ed.), Logic and computer science. Academic Press
47. R. Platek (1966), Foundations of recursion theory. Ph. D. Thesis, Stanford University.
48. E. L. Post (1944), “Recursively enumerable sets and their decision problems�?. Bull. AMS 50, 284-316.
49. C. Reade (1989), Elements of functional programming, Addison-Wesley.
50. H. Rogers, Jr. (1967), Theory of recursive functions and effective computability, McGraw-Hill.
51. G. E. Sacks (1963), Degrees of unsolvability. Annals of Math. Studies 55, Princeton.
52. G. E. Sacks (1990), Higher recursion theory, Springer-Verlag
53. J. Shepherdson (1988), “Mechanisms for computing over arbitrary structures�?. In: Herken 1988, 581-601.
54. J. Shepherdson / H. Sturgis (1963), “Computability of recursive functions�?, J. for the ACM 10, 217-255.
55. R. Shore (1977), "α-recursion theory�?. In: Barwise 1977, 653-680.
56. S. Simpson (1977), “Degrees of unsolvability: a survey of results�?. In: Barwise 1977, 631-652.
57. R. Smullyan (1961), Theory of formal systems, Annals Math. Studies 47, Princeton.
58. R. Soare (1987), Recursively enumerable sets and degrees. Springer-Verlag.
59. G. Tamburrini (1987), Reflections on mechanism. Ph. D. Thesis, Columbia Univ.
60. A. S. Troelstra (1977), “Aspects of constructive mathematics�?. In: Barwise 1977, 973-1052.
61. J. Tucker / J. Zucker (1988), “Program correctness over abstract data types with error-state semantics�?, CWI Monograph No. 6, Centre for Math and C. S., Amsterdam.
62. A. Turing (1936-37), “On computable numbers with an application to the Entscheidungsproblem�?, Proc. London Math. Soc. 42, 230-267
63. A. Turing (1939), “Systems of logic based on ordinals�?, Proc. London Math. Soc. 45, 161-228, Reprinted in Davis 1965.