Complex Boolean Turing Machines equate non-deterministic branching to algebraic field extensions over GF(4) while remaining polynomially equivalent to standard deterministic and non-deterministic Turing machines.
Ivm, ``Imaginary-part verification machine and essential dimension,'' 2026, submitted to IEEE FOCS 2026
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
-
Complex Boolean Turing Machines: An Algebraic Semantic Framework for Computational Complexity
Complex Boolean Turing Machines equate non-deterministic branching to algebraic field extensions over GF(4) while remaining polynomially equivalent to standard deterministic and non-deterministic Turing machines.