4 papers · 1 filter
Dual-Tape Perspective and Generator Independence: The Algebraic Foundation of Real Boolean Turing Machines
Jingwen Zheng, Bojin Zheng, Weiwu Wang
The Complex Boolean Turing Machine (CBTM) characterizes non-deterministic computation using the abstract generator , but the abstractness of makes it difficult to understand…
Complex Boolean Turing Machines: An Algebraic Semantic Framework for Computational Complexity
Bojin Zheng, Jingwen Zheng, Weiwu Wang
Traditional Turing machines are semantically poor, they only concern the syntactic manipulation of symbols, discarding the mathematical semantics behind the symbols. This semantic…
The Radical Solution and Computational Complexity
Bojin Zheng, Weiwu Wang
The radical solution of polynomials with rational coefficients is a famous solved problem. This paper found that it is a problem. Furthermore, this paper found that a…
The Linear Correlation of and
Bojin Zheng, Weiwu Wang
or is the core problem in computational complexity theory. In this paper, we proposed a definition of linear correlation of derived matrix…