The Halting Problem of one State Turing Machines with n‐Dimensional Tape

DOI10.1002/malq.19680140706zbMath0169.31104OpenAlexW1992296112MaRDI QIDQ5556432

Gabor T. Herman

Publication date: 1968

Published in: Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/malq.19680140706

zbMATH Keywords

recursion theory, constructive mathematics

Related Items

The Complexity of Small Universal Turing Machines: A Survey ⋮ Small deterministic Turing machines ⋮ Investigations on the power of matrix insertion-deletion systems with small sizes ⋮ Complexity of algorithms and computations ⋮ Remark on the computational power of a Turing machine variant