全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

Countability of Infinite Paths in the Infinity Tree: Proof of the Continuum Hypothesis in a Non-Cantorian Infinity Theory

DOI: 10.4236/apm.2025.151003, PP. 73-90

Keywords: Infinity, Countable, Uncountable, Diagonalization, Real Numbers, Infinity Tree, Continuum Hypothesis, Turing Machine, Infinite Time Turing Machine, Non-Cantorian

Full-Text   Cite this paper   Add to My Lib

Abstract:

A previous paper showed that the real numbers between 0 and 1 could be represented by an infinite tree structure, called the ‘infinity tree’, which contains only a countably infinite number of nodes and arcs. This paper discusses how a finite-state Turing machine could, in a countably infinite number of state transitions, write all the infinite paths in the infinity tree to a countably infinite tape. Hence it is argued that the real numbers in the interval [0, 1] are countably infinite in a non-Cantorian theory of infinity based on Turing machines using countably infinite space and time. In this theory, Cantor’s Continuum Hypothesis can also be proved. And in this theory, it follows that the power set of the natural numbers P(?) is countably infinite, which contradicts the claim of Cantor’s Theorem for the natural numbers. However, this paper does not claim there is an error in Cantor’s arguments that [0, 1] is uncountably infinite. Rather, this paper considers the situation as a paradox, resulting from different choices about how to represent and count the continuum of real numbers.

References

[1]  Jackson, P.C. (2023) The Infinity Tree: Representing Infinities of Real Numbers with Countably Infinite Tree Structures. Advances in Pure Mathematics, 13, 198-205.
https://doi.org/10.4236/apm.2023.134013
[2]  Cantor, G. (1891) On an Elementary Question in the Theory of Manifolds. In: Ewald, W.B., Ed., From Immanuel Kant to David Hilbert: A Source Book in the Foundations of Mathematics, Vol. 2, Oxford University Press, 920-922.
[3]  Turing, A.M. (1937) On Computable Numbers, with an Application to the Entscheidungs Problem. Proceedings of the London Mathematical Society, 2, 230-265.
https://doi.org/10.1112/plms/s2-42.1.230
[4]  Hopcroft, J.E., Motwani, R. and Ullman, J.D. (2007) Introduction to Automata Theory, Languages, and Computation. 3rd Edition, Addison-Wesley.
[5]  Minsky, M.L. (1967) Computation: Finite and Infinite Machines. Prentice-Hall.
[6]  Stannett, M. (2006) The Case for Hypercomputation. Applied Mathematics and Computation, 178, 8-24.
https://doi.org/10.1016/j.amc.2005.09.067
[7]  Hamkins, J.D. (2002) Infinite Time Turing Machines. Minds and Machines, 12, 521-539.
https://doi.org/10.1023/a:1021180801870
[8]  Cantor, G. (1878) Ein Beitrag zur Mannigfaltigkeitslehre. Journal für die reine und angewandte Mathematik (Crelles Journal), 1878, 242-258.
https://doi.org/10.1515/crll.1878.84.242
[9]  Hilbert, D. (1902) Mathematical Problems. Bulletin of the American Mathematical Society, 8, 437-479.
https://doi.org/10.1090/s0002-9904-1902-00923-3
[10]  Gödel, K. (1940) The Consistency of the Continuum Hypothesis. Princeton University Press.
[11]  Cohen, P.J. (1963) The Independence of the Continuum Hypothesis. Proceedings of the National Academy of Sciences, 50, 1143-1148.
https://doi.org/10.1073/pnas.50.6.1143
[12]  Cantor, G. (1874) On a Property of the Set of All Real Algebraic Numbers. In: Ewald, W.B., Ed., From Immanuel Kant to David Hilbert: A Source Book in the Foundations of Mathematics, Vol. 2, Oxford University Press, 839-843.
[13]  Hodges, W. (1998) An Editor Recalls Some Hopeless Papers. Bulletin of Symbolic Logic, 4, 1-16.
https://doi.org/10.2307/421003
[14]  Styrman, A. (2023) A Constructive Proof That the Real Numbers Are Countable. Unpublished Paper.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133