On Formalisms for Turing Machines
From MaRDI portal
Publication:5535413
DOI10.1145/321296.321308zbMath0154.41606MaRDI QIDQ5535413
Publication date: 1965
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/321296.321308
68Q04: Classical models of computation (Turing machines, etc.)
Related Items
Unnamed Item, The unsolvability of the uniform halting problem for two state Turing machines, A New Hierarchy of Elementary Functions, The complexity of small universal Turing machines: A survey, Remark on the computational power of a Turing machine variant, Multitape one-way nonwriting automata