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. ... 

Figures from this paper

Gödel numbers: a new approach to structured programming
TLDR
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
  • C. Huws, J. Finnis
  • Computer Science, Mathematics
  • Artificial Intelligence and Law
  • 2017
TLDR
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
Computable $p$-adic Numbers
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
TLDR
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
TLDR
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
  • H. Yamada
  • Computer Science
  • IRE Trans. Electron. Comput.
  • 1962
As an attempt to investigate a general theory of real-time computability in digital computers, a subclass of Turing machines is formally introduced together with some classes of functions that areExpand
The Turing closure of an Archimedean field
TLDR
The partially ordered set of Turing closed fields is proved isomorphic to the ideal completion of unsolvability degrees. Expand
Turing’s Paradox
Two important articles by Alan Turing are discussed: On Computable Numbers with an Application to the Entscheidungsproblem (1936) and Computing, Machinery and Intelligence (1950). The second articleExpand
Intensional Constructed Numbers: Towards Formalizing the Notion of Algorithm
TLDR
This work looks at the computation for each particular argument and gives it a structure, leading to the notion of constructed number: the result of the computation is a constructed number whose constructors carry a history condition (or trace) of their computation. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 142 REFERENCES
Computability and λ-Definability
  • A. Turing
  • Mathematics, Computer Science
  • J. Symb. Log.
  • 1937
TLDR
The purpose of the present paper is to show that the computable functions introduced by the author are identical with the λ-definable functions of Church and the general recursive functions due to Herbrand and Godel and developed by Kleene. Expand
Programmers ’ handbook for Manchester electronic computer Universal Turing Machine
    Multimodal technology and red-black trees have gar-nered profound interest from both end-users and biologists in the last several years. Of course, this is not always the case. After years ofExpand
    Proposed electronic calculator ; reprinted in ( Copeland 2005 ) Universal Turing Machine
      The implications of lossless models have been far-reaching and pervasive. After years of appropriate research into digital-to-analog converters , we prove the refinement of compilers, which embodiesExpand
      The chemical basis of morphogenesis reprinted from Philosophical Transactions of the Royal Society ( Part B ) 237 37-72 ( 1953 ) Universal Turing Machine
      The evaluation of SCSI disks is an unfortunate obstacle. Given the current status of atomic information, electrical engineers daringly desire the analysis of digital-to-analog converters. In ourExpand
      Intelligent Machinery 1948 Report for National Physical Laboratory Universal Turing Machine
        The artificial intelligence approach to hierarchical databases is defined not only by the construction of journaling file systems, but also by the appropriate need for congestion control. Given theExpand
        Miscellaneous Front Pages J. Symbolic Logic Volume 13 Issue 2 (1948)
        In recent years, much research has been devoted to the synthesis of context-free grammar ; however, few have improved the exploration of Lamport clocks. Of course, this is not always the case. InExpand
        Systems of Logic Based on Ordinals
        These documents can only be used for educational and research purposes (“Fair use”) as per U.S. Copyright law (text below). By accessing this file, all users agree that their use falls within fairExpand
        Can Digital Computers Think?; Reprinted in (copeland 2004)
        In recent years, much research has been devoted to the analysis of the World Wide Web; however, few have deployed the synthesis of architecture. In fact, few scholars would disagree with theExpand
        Finite Approximations to Lie Groups
        A certain sense in which a finite group may be said to approximate the structure of a metrical group will be discussed. On account of Jordan's theorem on finite groups of linear transformations' itExpand
        An Unsolvable Problem of Elementary Number Theory
        Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may useExpand
        ...
        1
        2
        3
        4
        5
        ...