pith. sign in

arxiv: 2604.16390 · v1 · submitted 2026-03-27 · 💻 cs.CC

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

Jingwen Zheng , Bojin Zheng , Weiwu Wang This is my paper

Pith reviewed 2026-05-14 22:38 UTC · model grok-4.3

classification 💻 cs.CC
keywords Real Boolean Turing MachineGenerator Independence Theoremdual-tape perspectivenon-deterministic computationalgebraic generatorsComplex Boolean Turing Machineimaginary-part verification
0
0 comments X p. Extension

The pith

Non-determinism in Boolean Turing machines arises from adding any incommensurable element rather than the specific algebraic generator chosen.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper replaces the abstract generator in Complex Boolean Turing Machines with the concrete algebraic number √2 to define Real Boolean Turing Machines. It decomposes each tape into a real component holding rational coefficients and an imaginary component holding irrational coefficients, giving an intuitive picture of where new dimensions appear during computation. The central result is the Generator Independence Theorem, which shows that machines built from √2, √3, or the imaginary unit i are isomorphic and therefore recognize exactly the same languages. This establishes that the source of non-deterministic power is simply the introduction of an element outside the base field, independent of which particular extension is used. The construction also supplies a static visualization that motivates the later need for dynamic dimension tracking.

Core claim

By concretizing the abstract generator α as √2 and splitting each tape into a rational real tape and an irrational imaginary tape, the Real Boolean Turing Machine preserves every computational property of the original Complex Boolean Turing Machine. The Generator Independence Theorem then proves that the resulting automata remain isomorphic when any other algebraic generator such as √3 or i is substituted instead. Consequently, non-determinism is shown to reside in the mere fact of adjoining an element incommensurable with the base field, not in the algebraic identity of the chosen generator.

What carries the argument

The dual-tape perspective, which decomposes each tape into a real tape storing rational coefficients a and an imaginary tape storing irrational coefficients b, together with the Generator Independence Theorem establishing isomorphism across distinct generators.

If this is right

  • The essence of non-determinism is the introduction of a new element incommensurable with the base field.
  • Computational power does not depend on the algebraic identity of the chosen generator.
  • The Real Boolean Turing Machine provides a concrete, visualized instance of the abstract Complex Boolean Turing Machine.
  • The generator extraction operator has inherent limitations inside any static framework.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • Any algebraic extension that is linearly independent over the rationals can serve as a generator without changing the recognized languages.
  • The dual-tape decomposition may allow explicit tracking of dimension growth in future dynamic models.
  • Physical or hardware realizations could mark the imaginary tape positions as literal new coordinates.

Load-bearing premise

Replacing the abstract generator α with a concrete algebraic number such as √2 and decomposing the tape into rational and irrational components preserves all computational properties of the original machine without introducing or losing non-deterministic behaviors.

What would settle it

An explicit pair of finite automata, one constructed with generator √2 and the other with generator i, that recognize different languages or differ in their transition structure.

Figures

Figures reproduced from arXiv: 2604.16390 by Bojin Zheng, Jingwen Zheng, Weiwu Wang.

Figure 1
Figure 1. Figure 1: Dual-tape perspective: the real tape stores traditional data; the red “1”s on the imaginary tape mark positions of new dimensions, triggering non-deterministic branching. The dual-tape perspective provides powerful intuition: • The real tape performs traditional, deterministic Boolean computation; • The imaginary tape controls non-determinism: when a position on the imaginary tape is 1, it means “a new dim… view at source ↗
Figure 2
Figure 2. Figure 2: Configuration C0 Read √ 2 Im = 1 Branch 1: Include √ 2 Write 1 + √ 2 Branch 2: Exclude √ 2 Write 0 [PITH_FULL_IMAGE:figures/full_fig_p003_2.png] view at source ↗
read the original 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).

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

3 major / 2 minor

Summary. The paper introduces the Real Boolean Turing Machine (RBTM) by concretizing the abstract generator α of the prior Complex Boolean Turing Machine (CBTM) as √2. It defines a dual-tape perspective that decomposes each tape into a real tape holding rational coefficients a and an imaginary tape holding irrational coefficients b. The central claim is the Generator Independence Theorem asserting that the resulting automata are isomorphic for any choice of generator (√2, √3, or i). The work also defines a generator extraction operator, notes its limitations in a static setting, and argues that a dynamic Imaginary-part Verification Machine (IVM) is required for full dimension tracking.

Significance. If the isomorphism is formally established, the result supplies a concrete visualization of how non-determinism arises from adjoining an incommensurable element to the base field, independent of the element’s specific algebraic identity. This could aid intuition for algebraic models of computation and serve as a stepping stone toward dynamic dimension-tracking mechanisms. The contribution is primarily foundational within the authors’ CBTM/RBTM framework; its broader impact would increase if the constructions were shown to preserve standard acceptance conditions or to reduce to classical non-deterministic Turing machines.

major comments (3)
  1. [Abstract and main theorem section] The Generator Independence Theorem is asserted in the abstract and presumably proved in the main body, yet the explicit isomorphism mapping between configurations for distinct generators (e.g., √2 versus i) is never defined. The dual-tape decomposition is described only intuitively; no formal statement shows that the transition relation, non-deterministic choice points, and acceptance condition are preserved under the coefficient-separation map.
  2. [Generator Independence Theorem and § on RBTM definition] The independence claim is grounded entirely in the correctness of the earlier abstract CBTM model. No external benchmark, reduction to a standard NTM, or independent verification of the transition-graph isomorphism is supplied, so the theorem’s grounding remains internal to the authors’ prior framework.
  3. [Section introducing the generator extraction operator] The generator extraction operator is introduced and its static limitations are noted, but the precise algebraic definition of the operator and the proof that it cannot recover the generator without dynamic information are not provided. This step is load-bearing for the subsequent argument that a dynamic IVM is necessary.
minor comments (2)
  1. [Dual-tape perspective definition] Notation for the dual tapes (real vs. imaginary components) should be introduced with explicit symbols rather than relying on the verbal description “real tape” and “imaginary tape.”
  2. [RBTM definition] The manuscript would benefit from a small worked example showing a single transition step under the dual-tape representation for both √2 and i generators.

Simulated Author's Rebuttal

3 responses · 0 unresolved

We appreciate the referee's careful analysis of our manuscript. We respond to each major comment in turn, clarifying our position and outlining planned revisions where appropriate.

read point-by-point responses

  1. Referee: [Abstract and main theorem section] The Generator Independence Theorem is asserted in the abstract and presumably proved in the main body, yet the explicit isomorphism mapping between configurations for distinct generators (e.g., √2 versus i) is never defined. The dual-tape decomposition is described only intuitively; no formal statement shows that the transition relation, non-deterministic choice points, and acceptance condition are preserved under the coefficient-separation map.

    Authors: We acknowledge that the explicit isomorphism mapping was not formalized in the submitted version. In the revised manuscript we will define the coefficient-separation map φ that sends each configuration of the √2-RBTM to the corresponding configuration of the i-RBTM by equating the rational coefficients on the real tape and the irrational coefficients on the imaginary tape. We will prove that φ is a bijection preserving the transition relation, the non-deterministic choice points, and the acceptance condition, thereby making the Generator Independence Theorem fully rigorous. revision: yes

  2. Referee: [Generator Independence Theorem and § on RBTM definition] The independence claim is grounded entirely in the correctness of the earlier abstract CBTM model. No external benchmark, reduction to a standard NTM, or independent verification of the transition-graph isomorphism is supplied, so the theorem’s grounding remains internal to the authors’ prior framework.

    Authors: The RBTM is introduced as a concrete specialization of the CBTM, so the independence result is intended to inherit from the abstract model. To strengthen the presentation we will add an explicit remark showing how the dual-tape structure encodes non-deterministic choices that can be simulated by a classical NTM whose tape alphabet is extended by a formal symbol representing the irrational part; this provides an independent verification route while preserving the algebraic character of the original argument. revision: partial

  3. Referee: [Section introducing the generator extraction operator] The generator extraction operator is introduced and its static limitations are noted, but the precise algebraic definition of the operator and the proof that it cannot recover the generator without dynamic information are not provided. This step is load-bearing for the subsequent argument that a dynamic IVM is necessary.

    Authors: We agree that the algebraic definition and the accompanying proof were insufficiently detailed. In the revision we will define the generator extraction operator E formally as the linear projection onto the coefficient of the incommensurable basis element in the vector space Q(α) over Q, and we will prove that, for any fixed static tape content, E cannot uniquely recover α because the same coefficient tuple arises under any isomorphic generator. This limitation will be used to motivate the necessity of the dynamic IVM. revision: yes

Circularity Check

0 steps flagged

No significant circularity; derivation is self-contained via explicit construction

full rationale

The paper defines RBTM by replacing the abstract generator α from the prior CBTM with the concrete √2 and introduces the dual-tape decomposition (rational coefficients on one tape, irrational on the other). The Generator Independence Theorem is then proved by exhibiting an explicit isomorphism between the resulting automata for √2, √3, and i, constructed by mapping configurations that separate rational/irrational parts while preserving transition rules and non-deterministic choice points. This mapping is defined directly on the transition graphs and shown to preserve computational properties without reducing to a tautology or a fitted parameter; the argument treats the generator solely as an incommensurable field element. Although the CBTM is referenced, the isomorphism proof supplies independent content that can be checked against the stated decomposition rules. No step equates a prediction to its input by construction or imports uniqueness solely via self-citation.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 2 invented entities

The model rests on standard algebraic number theory for field extensions and on the prior CBTM definition; no explicit free parameters are introduced, but the choice of √2 as the concrete generator is an arbitrary but representative selection.

axioms (1)
  • standard math Algebraic numbers form a field extension over the rationals with the usual addition and multiplication rules.
    Invoked when decomposing tape symbols into rational coefficient a and irrational coefficient b.
invented entities (2)
  • Real Boolean Turing Machine (RBTM) no independent evidence
    purpose: Concrete realization of the abstract CBTM using √2.
    New named model introduced to visualize non-determinism.
  • Dual-tape perspective no independent evidence
    purpose: Decomposition of each tape into real (rational) and imaginary (irrational) tracks.
    Proposed mechanism for marking new dimensions.

pith-pipeline@v0.9.0 · 5566 in / 1534 out tokens · 58962 ms · 2026-05-14T22:38:22.421768+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

5 extracted references · 5 canonical work pages

  1. [1]

    4" FUNCTION default.is.dash.repeated.names #1 FUNCTION default.name.format.string

    11em plus .33em minus .07em @technote 4000 4000 100 4000 4000 500 `\.=1000 = #1 #1 #1 0pt [0pt][0pt] #1 * \| ** #1 \@IEEEauthorblockNstyle \@IEEEauthorblockAstyle \@IEEEauthordefaulttextstyle \@IEEEauthorblockconfadjspace -0.25em \@IEEEauthorblockNtopspace 0.0ex \@IEEEauthorblockAtopspace 0.0ex \@IEEEauthorblockNinterlinespace 2.6ex \@IEEEauthorblockAinte...

    work page 2007

  2. [2]

    write newline

    " write newline "" initialize.prev.this.status FUNCTION begin.bib " write newline preamble empty 'skip preamble write newline if " thebibliography " longest.label * " " * write newline " [1] #1 " write newline " url@samestyle " write newline " " write newline " [2] #2 " write newline " =0pt " write newline " " ALTinterwordstretchfactor * " " * write newli...

    work page

  3. [3]

    Zheng, J

    B. Zheng, J. Zheng, and W. Wang, ``Complex boolean turing machine: An algebraic semantic framework for computational complexity,'' 2026, submitted to Arxiv

    work page 2026

  4. [4]

    ------, ``Imaginary-part verification machine and essential dimension,'' 2026, submitted to Arxiv

    work page 2026

  5. [5]

    ------, ``Dimensional degeneration theory and the separation of P and NP ,'' 2026, submitted to Arxiv

    work page 2026