SearcharxivSearch

arXiv · 2604.16390

Dual-Tape Perspective and Generator Independence: The Algebraic Foundation of Real Boolean Turing Machines

Abstract

The Complex Boolean Turing Machine (CBTM) characterizes non-deterministic computation using the abstract generator $\alpha$, but the abstractness of $\alpha$ makes it difficult to understand intuitively. In this paper, by concretizing $\alpha$ as the algebraic number $\sqrt{2}$, we introduce the \textbf{Real Boolean Turing Machine (RBTM)} and propose the \textbf{dual-tape perspective}, decomposing each tape into a real tape (storing rational coefficients $a$) and an imaginary tape (storing irrational coefficients $b$). The ``1''s on the imaginary tape intuitively mark the locations of ``new dimensions,'' laying a physical foundation for subsequent dynamic dimension tracking. More importantly, we prove the \textbf{Generator Independence Theorem}: computational power is independent of the specific choice of generator, whether using $\sqrt{2}$, $\sqrt{3}$, or the imaginary unit $i$, the corresponding automata are isomorphic. This reveals that the essence of non-determinism lies in the fact of ``introducing a new element incommensurable with the base field,'' rather than the algebraic identity of the generator. Furthermore, we introduce the \textbf{generator extraction operator} and analyze its limitations within a static framework, highlighting the necessity of introducing a dynamic IVM. The RBTM serves both as a visualized instance of the CBTM and as a bridge to the subsequent dynamic dimension tracking of the Imaginary-part Verification Machine(IVM).

Explore related subjects

Keep this discovery

BibTeXRIS

Jingwen Zheng, Bojin Zheng, Weiwu Wang. 2026-03-27. Dual-Tape Perspective and Generator Independence: The Algebraic Foundation of Real Boolean Turing Machines. https://arxiv.org/abs/2604.16390

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

The Computational Complexity of Holant Problems on 4-regular Graphs from the Stable Subgroup Sequence of $SL(2,\mathbb{C})$

The Holant framework provides a general setting for studying counting problems and includes graph homomorphisms (\#GH) and counting constraint satisfaction problems (\#CSP) as special cases. Over the past twenty years, a series of computational complexity dichotomies have been established for Holant problems, but the classification for complex-valued signatures is still open. The main obstacle is the case in which all signatures have even arity. In this paper, we establish a dichotomy for Holant problems with a complex-valued 4-ary signature, which is a key base case for the full classification of Holant problems. We present a new strategy by introducing Schur's theorem, the classification of finite subgroups of $\mathrm{SL}(2,\mathbb{C})$ and stable subgroup sequences into the proof. These new techniques are of independent interest.

cs.CC

Topology inside NC$^1$

We show that ACC$^0$ is precisely what can be computed with constant-width circuits of polynomial size and polylogarithmic genus. This extends a characterization given by Hansen, showing that planar constant-width circuits also characterize ACC$^0$. Thus polylogarithmic genus provides no additional computational power in this model. We consider other generalizations of planarity, including crossing number and thickness. We show that constant-width circuits of polynomial size and thickness two already suffice to capture all of NC$^1$.

cs.CC