Computability and λ-definability

Journal of Symbolic Logic 2 (4):153-163 (1937)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2268280

Other Versions

reprint Turing, A. M. (1938) "Computability and λ-Definability". Journal of Symbolic Logic 3(2):89-89

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,733

External links

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

Through your library

My notes

Similar books and articles

Turing A. M.. Computability and λ-definability.Rózsa Péter - 1938 - Journal of Symbolic Logic 3 (2):89-89.
Completeness, invariance and λ-definability.R. Statman - 1982 - Journal of Symbolic Logic 47 (1):17-26.
Definability, automorphisms, and dynamic properties of computably enumerable sets.Leo Harrington & Robert I. Soare - 1996 - Bulletin of Symbolic Logic 2 (2):199-213.
The Present Theory of Turing Machine Computability.C. E. M. Yates - 1966 - Journal of Symbolic Logic 31 (3):513.
On homogeneity and definability in the first-order theory of the Turing degrees.Richard A. Shore - 1982 - Journal of Symbolic Logic 47 (1):8-16.
On formalism freeness: Implementing gödel's 1946 princeton bicentennial lecture.Juliette Kennedy - 2013 - Association for Symbolic Logic: The Bulletin of Symbolic Logic 19 (3).
Robert I. Soare, Turing Computability, Theory and Applications of Computability, Springer-Verlag, Berlin, Heidelberg, 2016, xxxvi + 263 pp. [REVIEW]Damir D. Dzhafarov - 2017 - Bulletin of Symbolic Logic 23 (1):113-115.

Analytics

Added to PP
2009-01-28

Downloads
286 (#94,413)

6 months
15 (#197,612)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

The Church-Turing Thesis.B. Jack Copeland - 2012 - In Ed Zalta (ed.), Stanford Encyclopedia of Philosophy. Stanford, CA: Stanford Encyclopedia of Philosophy.
Computability and recursion.Robert I. Soare - 1996 - Bulletin of Symbolic Logic 2 (3):284-321.
Is the church-Turing thesis true?Carol E. Cleland - 1993 - Minds and Machines 3 (3):283-312.

View all 27 citations / Add more citations

References found in this work

On Computable Numbers, with an Application to the Entscheidungsproblem.Alan Turing - 1936 - Proceedings of the London Mathematical Society 42 (1):230-265.

Add more references