Concretizing the abstract generator as √2 yields the Real Boolean Turing Machine whose dual-tape structure separates rational and irrational coefficients, with a proof that computational power remains identical for any incommensurable generator such as √3 or i.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Dual-Tape Perspective and Generator Independence: The Algebraic Foundation of Real Boolean Turing Machines
Concretizing the abstract generator as √2 yields the Real Boolean Turing Machine whose dual-tape structure separates rational and irrational coefficients, with a proof that computational power remains identical for any incommensurable generator such as √3 or i.