Author:Apoloniusz Tyszka

Publications
The Physical Impossibility of Machine Computations on Sufficiently Large Integers Inspires an Open Problem That Concerns Abstract Computable Sets X⊆N and Cannot Be Formalized in the Set Theory ZFC as It Refers to Our Current Knowledge on X Sławomir Kurpaska and Apoloniusz Tyszka EasyChair Preprint 3648

Keyphrases

complexity of a mathematical definition, computable set X⊆N, current knowledge on X, explicitly known integer n, impossibility of computations on large integers, infiniteness of X remains conjectured, n bounds X from above when X is finite, no known algorithm decides the finiteness of X, statement that cannot be formalized in ZFC.