A. M. Turing. On computable numbers, with an application to the Entscheidungs problcm. Proceedings of the London Mathematical Society, 2 s. vol. 42 (1936–1937), pp. 230–265.

Alonzo Church

doi:10.2307/2268808

Abstract

An abstract is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.

Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'

Crossref Citations

This article has been cited by the following publications. This list is generated based on data provided by Crossref.

Gandy, Robin 1995. The Universal Turing Machine A Half-Century Survey. Vol. 2, Issue. , p. 51.

Soare, Robert I. 1996. Computability and Recursion. Bulletin of Symbolic Logic, Vol. 2, Issue. 3, p. 284.

Sieg, Wilfried 1997. Step by Recursive Step: Church's Analysis of Effective Calculability. Bulletin of Symbolic Logic, Vol. 3, Issue. 2, p. 154.

Soare, Robert I. 1999. Handbook of Computability Theory. Vol. 140, Issue. , p. 3.

Copeland, B. Jack 2002. Unconventional Models of Computation. Vol. 2509, Issue. , p. 15.

Copeland, B.Jack 2004. Hypercomputation: philosophical issues. Theoretical Computer Science, Vol. 317, Issue. 1-3, p. 251.

KERCEL, STEPHEN W. REBER, ARTHUR S. and MANGES, WAYNE W. 2005. SOME RADICAL IMPLICATIONS OF BACH-Y-RITA'S DISCOVERIES. Journal of Integrative Neuroscience, Vol. 04, Issue. 04, p. 551.

Tretiakov, A. Nian-Shing Chen Kinshuk and Hartmann, S. 2005. Formal logic as a learning facilitation tool. p. 459.

Kercel, Stephen 2006. Systems Biology. p. 139.

Davis, Martin 2006. Imagination and Rigor. p. 63.

Stannett, Mike 2006. The case for hypercomputation. Applied Mathematics and Computation, Vol. 178, Issue. 1, p. 8.

Leiber, Justin 2006. Turing's Golden: How Well Turing's Work Stands Today. Philosophical Psychology, Vol. 19, Issue. 1, p. 13.

Hodges, A. and Cortada, J.W. 2006. Reviews. IEEE Annals of the History of Computing, Vol. 28, Issue. 3, p. 81.

Davis, Martin 2006. Logical Approaches to Computational Barriers. Vol. 3988, Issue. , p. 125.

Sieg, Wilfried 2007. On mind & Turing’s machines. Natural Computing, Vol. 6, Issue. 2, p. 187.

Louie, A. H. and Kercel, Stephen W. 2007. Topology and Life Redux: Robert Rosen’s Relational Diagrams of Living Systems. Axiomathes, Vol. 17, Issue. 2, p. 109.

Soare, Robert I. 2007. Computation and Logic in the Real World. Vol. 4497, Issue. , p. 705.

Hodges, Andrew 2008. New Computational Paradigms. p. 3.

Lassègue, Jean 2009. Parsing the Turing Test. p. 151.

Yan, Song Y. 2013. Quantum Attacks on Public-Key Cryptosystems. p. 1.

Download full list

Article contents

A. M. Turing. On computable numbers, with an application to the Entscheidungs problcm. Proceedings of the London Mathematical Society, 2 s. vol. 42 (1936–1937), pp. 230–265.

Review products

Abstract

Access options

This article has been cited by the following publications. This list is generated based on data provided by Crossref.

Article contents

A. M. Turing. On computable numbers, with an application to the Entscheidungs problcm. Proceedings of the London Mathematical Society, 2 s. vol. 42 (1936–1937), pp. 230–265.

Review products

Abstract

Access options

Save article to Kindle

Save article to Dropbox

Save article to Google Drive

Reply to: Submit a response

Your details

You have entered the maximum number of contributors

Conflicting interests