Keywords
Computable numberComputer scienceMathematicsComputable functionCombinatoricsComputable analysis
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...
Scale-sensitive dimensions, uniform convergence, and learnability
Learnability in Valiant's PAC learning model has been shown to be strongly related to the existence of uniform laws of large numbers. These laws define a distribution-free conve...
Randomness and degrees of irregularity.
The fundamental question "Are sequential data random?" arises in myriad contexts, often with severe data length constraints. Furthermore, there is frequently a critical need to ...
Introduction to Algorithms
From the Publisher: The updated new edition of the classic Introduction to Algorithms is intended primarily for use in undergraduate or graduate courses in algorithms or data s...
Publication Info
- Year
- 1960
- Type
- book-chapter
- Pages
- 230-264
- Citations
- 26
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
26
OpenAlex
Cite This
Alan Turing
(1960).
On Computable Numbers, with an Application to the Entscheidungsproblem.
Annual Review in Automatic Programming
, 230-264.
https://doi.org/10.1016/b978-0-08-009217-1.50024-4
Identifiers
- DOI
- 10.1016/b978-0-08-009217-1.50024-4