Can Turing machines capture everything we can compute?

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

If we define classical foundational concepts constructively, and introduce non-algorithmic effective methods into classical mathematics, then we can bridge the chasm between truth and provability, and define computational methods that are not Turing-computable.
v2; introduced standardised ACI compliant notation for citations; 13 pages; an HTML version is available at http://alixcomsi.com/Can_Turing_machines.htm

Keywords

General Mathematics, 03B10

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/67230

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0304379
 http://arxiv.org/abs/math/0304379

Collections

arXiv