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={Journal of Symbolic Logic},
year={1937},
volume={2},
pages={42},
url={https://api.semanticscholar.org/CorpusID:73712}
}A description of the diagonal process of the universal computing machine, which automates the enumeration of computable sequences and numbers in circle and circle-free numbers.
Topics
Computable Numbers (opens in a new tab)Entscheidungsproblem (opens in a new tab)Universal Computing Machine (opens in a new tab)Computing Machines (opens in a new tab)Computable Sequences (opens in a new tab)Effective Calculability (opens in a new tab)A-machine (opens in a new tab)Universal Machine (opens in a new tab)Circle-free (opens in a new tab)Computability (opens in a new tab)
8,349 Citations
Epi-constructivism: Decidable sets of computable numbers as foundational objects for mathematics
- 2022
Mathematics
It is well known that the R, the set of real numbers, is an abstract set, where almost all its elements cannot be described in any finite language. We investigate possible approaches to what might be…
An Introduction to Some Basic Concepts and Techniques in the Theory of Computable Functions
- 1976
Mathematics
A function is considered to be computable if there exists an “effective description” for it, that is a finite sentence unambiguously indicating what is its “behaviour” in correspondence to each natural number.
Computable analysis and notions of continuity in Coq
- 2021
Computer Science, Mathematics
A number of formal proofs of theorems from the field of computable analysis are given that the algebraic operations and the efficient limit operator on the reals are computable, and that certain countably infinite products are isomorphic to spaces of functions.
Quantitative continuity and computable analysis in Coq
- 2019
Mathematics, Computer Science
A number of formal proofs of theorems from the field of computable analysis are given that the algebraic operations and the efficient limit operator on the reals are computable, and that certain countably infinite products are isomorphic to spaces of functions.
A Foundation for Computable Analysis
- 1997
Mathematics, Computer Science
The paper gives a short introduction to basic concepts of TTE (Type 2 Theorie of Effectivity), and shows its general applicability by some selected examples, and discusses the problem of zero-finding.
Review of models of computation: an introduction to computability theory, by Maribel Fernández
- 2012
Computer Science, Mathematics
In 1936 Turing presented his wonderful machine that settled the matter: effective computability means computable by a Turing machine and, if the authors assume the Church thesis, there is no algorithm to decide whether a first-order formula is provable or not.
Polynomial Time Computation in the Context of Recursive Analysis
- 2009
Computer Science, Mathematics
This article gives a definition of polynomial time computability of arbitrary real functions and presents two main applications based on that definition, which have already been published and are new contribution to this article.
An Effective Procedure for Computing "Uncomputable" Functions
- 2013
Computer Science, Mathematics
It is proved that the second input cannot be set to the Goedel number of any Turing-computable function that computes the output from any natural number in its first input, and that creative procedures model an aspect of reasoning that cannot be modeled by Turing machines.
Computability and Differential Fields : a Tutorial
- 2008
Mathematics
In this chapter, the terms computable function and recursive function are to be treated as interchangeable and Computable model theory applies the notions of computability theory to arbitrary mathematical structures.