Work

A definable number which cannot be approximated algorithmically

Year: 2010

Type: preprint

Abstract: The Turing machine (TM) and the Church thesis have formalized the concept of computable number, this allowed to display non-computable numbers. 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. Then an example of a number not approachable by a TM is given.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.1003.0480

Author: Brener, Nicolas

Institutions: Institut Systèmes Intelligents et de Robotique, Université Pierre-et-Marie-Curie

Language: English

Topic: Computability, Logic, AI Algorithms

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W1807932477

Cites: 2

Cited by:

Related to: 20