arXiv Open Access 2010

A definable number which cannot be approximated algorithmically

Nicolas Brener

Lihat Sumber

Abstrak

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.

Topik & Kata Kunci

cs.CC cs.LO

Penulis (1)

Nicolas Brener

Format Sitasi

APA MLA BibTeX

Brener, N. (2010). A definable number which cannot be approximated algorithmically. https://arxiv.org/abs/1003.0480

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2010
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓