# On Computable Numbers, with an Application to the Entscheidungsproblem

```@article{Turing1937OnCN,
title={On Computable Numbers, with an Application to the Entscheidungsproblem},
author={A. Turing},
journal={Proceedings of The London Mathematical Society},
year={1937},
volume={41},
pages={230-265}
}```
• A. Turing
• Published 1937
• Mathematics
• Proceedings of The London Mathematical Society
1. Computing machines. 2. Definitions. Automatic machines. Computing machines. Circle and circle-free numbers. Computable sequences and numbers. 3. Examples of computing machines. 4. Abbreviated tables Further examples. 5. Enumeration of computable sequences. 6. The universal computing machine. 7. Detailed description of the universal machine. 8. Application of the diagonal process. Pagina 1 di 38 On computable numbers, with an application to the Entscheidungsproblem A. M. ...
7,719 Citations
Gödel numbers: a new approach to structured programming
There is a correspondence between the natural numbers a~:d the computable functions, such that each computable function corresponds to infinitely many natural numbers and each natural number corresponds to a unique computablefunction. Expand
On computable numbers with an application to the AlanTuringproblem
• Computer Science, Mathematics
• Artificial Intelligence and Law
• 2017
The article explores the parameters of computability within the law and analyses the applicability of Turing’s computability thesis within the context of legal decision-making. Expand
In the present work the notion of the computable (primitive recursive, polynomially time computable) p–adic number is introduced and studied. Basic properties of these numbers and the set of indicesExpand
A definable number which cannot be approximated algorithmically
This paper defines the concept of number "approachable" by a TM and shows that some (if not all) known non-computable numbers are approachable by TMs. Expand
Construction of a Basic Calculator through the Turing Machine - A Review
This paper focuses on the Turing Machine usage as a basic calculator and refers the four primary arithmetic operations, namely 1.Addition, 2.Subtraction, 3.Multiplication, and 4. Expand
Computability by probabilistic Turing machines
In the present paper, the definition of probabilistic Turing machines is extended to allow the introduction of relative computability. Relative computable functions, predicates and sets are discussedExpand
Real-Time Computation and Recursive Functions Not Real-Time Computable