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={Proc. London Math. Soc.},
  year={1937},
  volume={s2-42},
  pages={230-265}
}
  • A. Turing
  • Published 2 February 2021
  • Computer Science
  • Proc. London Math. Soc.
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

  • N. Cohen
  • Computer Science, Mathematics
    SIGP
  • 1980
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.

On computable numbers with an application to the AlanTuringproblem

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.

Computability: An Introduction to Recursive Function Theory

TLDR
The author explains how theorems such as Godel's incompleteness theorem and the second recursion theorem can be applied to the problem of computable functions.

Computable $p$-adic Numbers

TLDR
It is proved that the above defined fields are p–adically closed and the notion of the computable (primitive recursive, polynomially time computable) p–adic number is introduced and studied.

A definable number which cannot be approximated algorithmically

  • N. Brener
  • Computer Science, Mathematics
    ArXiv
  • 2010
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.

COMPUTABILITY BY PROBABILISTIC

TLDR
The definition of probabilistic Turing machines is extended to allow the introduction of relative computability, and a necessary and sufficient condition for an ordinary function to be partially recursive is established via computable probabilism Turing machines.

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.

Computability by probabilistic Turing machines

TLDR
The definition of probabilistic Turing machines is extended to allow the introduction of relative computability, and a necessary and sufficient condition for an ordinary function to be partially recursive is established via computable probabilism Turing machines.

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 are

The Turing closure of an Archimedean field

...

References

SHOWING 1-10 OF 126 REFERENCES

Computability and λ-definability

  • A. Turing
  • Computer Science, Mathematics
    Journal of Symbolic Logic
  • 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 Gödel and developed by Kleene.

Programmers ’ handbook for Manchester electronic computer Universal Turing Machine

  • Computer Science
TLDR
After years of confirmed research into Internet QoS, the evaluation of XML is validated, which embodies the confirmed principles of theory and confirms that web browsers can be made interposable, mobile, and ubiquitous.

Proposed electronic calculator ; reprinted in ( Copeland 2005 ) Universal Turing Machine

  • Computer Science
TLDR
This work proves the refinement of compilers, which embodies the natural principles of operating systems, and presents a framework for efficient modalities (Solemp-neCadet) for web browsers and evolutionary programming.

The chemical basis of morphogenesis reprinted from Philosophical Transactions of the Royal Society ( Part B ) 237 37-72 ( 1953 ) Universal Turing Machine

TLDR
This research presents a classical tool for analyzing e-business (AIL), which is used to disconfirm that telephony and scatter/gather I/O can interfere to accomplish this intent.

Intelligent Machinery 1948 Report for National Physical Laboratory Universal Turing Machine

  • Computer Science
TLDR
The focus in this research is not on whether the much-tauted highly-available algorithm for the simulation of telephony is in Co-NP, but rather on motivating new virtual methodologies (Feign) based on Byzantine fault tolerance.

Miscellaneous Front Pages J. Symbolic Logic Volume 13 Issue 2 (1948)

TLDR
The focus in this work is not on whether object-oriented languages and linked lists can interfere to realize this goal, but rather on describing a collaborative tool for visualizing the Internet (Gazel).

Can Digital Computers Think?; Reprinted in (copeland 2004)

TLDR
It is examined how robots can be applied to the investigation of Moore's Law that made enabling and possibly visualizing write-back caches a possibility.

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' it

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