Keywords
TuringComputer scienceCitationTuring machineMathematicsInformation retrievalLibrary scienceAlgorithmProgramming language
Affiliated Institutions
Related Publications
Quantum circuit complexity
We propose a complexity model of quantum circuits analogous to the standard (acyclic) Boolean circuit model. It is shown that any function computable in polynomial time by a qua...
Computing Machinery and Intelligence (1950)
Abstract Together with ‘On Computable Numbers’, ‘Computing Machinery and Intelligence’ forms Turing’s best-known work. This elegant and sometimes amusing essay was originally pu...
The quantum challenge to structural complexity theory
A nontechnical survey of recent quantum-mechanical discoveries that challenge generally accepted complexity-theoretic versions of the Church-Turing thesis is presented. In parti...
Machines and Thought
Abstract This is the first of two volumes of essays in commemoration of Alan Turing, whose pioneering work in the theory of artificial intelligence and computer science continue...
Quantum theory, the Church–Turing principle and the universal quantum computer
It is argued that underlying the Church–Turing hypothesis there is an implicit physical assertion. Here, this assertion is presented explicitly as a physical principle: ‘every f...
Publication Info
- Year
- 1937
- Type
- article
- Volume
- s2-42
- Issue
- 1
- Pages
- 230-265
- Citations
- 7959
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
7959
OpenAlex
Cite This
Alan Turing
(1937).
On Computable Numbers, with an Application to the Entscheidungsproblem.
Proceedings of the London Mathematical Society
, s2-42
(1)
, 230-265.
https://doi.org/10.1112/plms/s2-42.1.230
Identifiers
- DOI
- 10.1112/plms/s2-42.1.230