References
- American Journal of Mathematics v.58 no.1936 An unsolvable problem of elementary number theory Church, A;M. Davis(ed)
- Proceedings of the London Mathematical Society, ser 2 v.42;43 no.1936 On Computable Numbers, with an application to the Entschei dungsprobluem Turing, A;M. Davis(ed)
- Journal of Symbolic Logic v.1 Finite combinatory processes-formulation Ⅰ Post, E.L;M. Davis(ed)
- Collected Works Ⅰ: Publication 1929-36 On undecidable propositions of formal mathematical systems, notes by S.C. Kleene, and J. B. Rosser on lectures at the Institute for Advanced Study, Princeton Godel, K;S. Feferman(ed)
- Collected Works Ⅰ: Publications 1929-36 v.195 Postscriptum to Godel 1931 Godel, K;K. Godel;S. Feferman(et al.)
- Collected Works Ⅱ: Publications 1938-74 Remarks before the Princeton bicentennial conference on problems in mathematics Godel, K;K. Godel;S. Feferman(et al.)
- Collected Works Ⅲ: Unpublished essays and lectures Some basic theorems on the foundations of mathematics and their implications Godel, K;K. Godel;S. Feferman(et al.)
- Information and Control v.4 Why Godel did not have Church's Thesis Davis, M
- The Bulletin of Symbolic Logic v.2 no.3 Computability and Recursion Soare, R.I
- Duke mathematical journal v.2 λ-definability and recursiveness Kleen, S.C
- Mathematics and Mind Mechanical procedures and mathematical experience Sieg, W;A. George(ed)
- The Universal Turing Machine. A Half-Century Survey Mathematical Logic and the Origin of Modern Computer Davis, M;Herken(ed)