We present a construction to simulate Turing machines with 3×3 matrices over rationals. The correctness of simulation is guaranteed by testing that the matrices have integral elements during the simulation. This construction implies an undecidability result for a special identity problem for semigroups of 3×3-matrices.
No takes yet. Share an insight, caveat, or question.
Halava et al. (2024) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: