On Formalisms for Turing Machines

DOI10.1145/321296.321308zbMath0154.41606OpenAlexW2069980124WikidataQ128253677 ScholiaQ128253677MaRDI QIDQ5535413

Patrick C. Fischer

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

Mathematics Subject Classification ID

Classical models of computation (Turing machines, etc.) (68Q04)

Related Items (8)

The Complexity of Small Universal Turing Machines: A Survey ⋮ The unsolvability of the uniform halting problem for two state Turing machines ⋮ A New Hierarchy of Elementary Functions ⋮ Unnamed Item ⋮ Remark on the computational power of a Turing machine variant ⋮ The complexity of small universal Turing machines: A survey ⋮ A formalization of multi-tape Turing machines ⋮ Multitape one-way nonwriting automata

This page was built for publication: On Formalisms for Turing Machines