A. M. Turing. Computability and λ-definability. The journal of symbolic logic, Bd. 2 , S. 153–163 [Book Review]

Journal of Symbolic Logic 3 (2):89-89 (1938)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,923

External links

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

Through your library

Similar books and articles

Computability and $lambda$-Definability.A. M. Turing - 1937 - Journal of Symbolic Logic 2 (4):153-163.
Computability and λ-definability.A. M. Turing - 1937 - Journal of Symbolic Logic 2 (4):153-163.
Computability and recursion.Robert I. Soare - 1996 - Bulletin of Symbolic Logic 2 (3):284-321.
Alan Turing and the foundations of computable analysis.Guido Gherardi - 2011 - Bulletin of Symbolic Logic 17 (3):394-430.
Godel on computability.W. Sieg - 2006 - Philosophia Mathematica 14 (2):189-207.
Turing computations on ordinals.Peter Koepke - 2005 - Bulletin of Symbolic Logic 11 (3):377-397.
Hypercomputation.B. Jack Copeland - 2002 - Minds and Machines 12 (4):461-502.

Analytics

Added to PP
2013-11-22

Downloads
13 (#1,062,726)

6 months
1 (#1,511,647)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references