On Formalisms for Turing Machines

DOI10.1145/321296.321308MaRDI QIDQ5535413zbMATH OpenOpenAlexWikidataFDO

Authors 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)

Recommendations

• Turing machine and its symbolic simulation
• scientific article; zbMATH DE number 1396672
• scientific article; zbMATH DE number 1157791
• Fast Simulation of Turing Machines by Random Access Machines
• scientific article; zbMATH DE number 1512850

Cited in

(30)

• The complexity of small universal Turing machines: A survey
• Remark on the computational power of a Turing machine variant
• Closed-form analytic maps in one and two dimensions can simulate universal Turing machines
• Structured Turing machines
• On the structural simplicity of machines and languages
• On TAE machines and their computational power
• Mutual upper bounds of size and time for a Turing machine and a Markov-Post algorithm for mutual simulations
• Simulating Turing machines on Maurer machines
• Multitape one-way nonwriting automata
• Simultaneous Markov-like algorithms.
• Turing machines for dummies. Why representations do matter
• The Complexity of Small Universal Turing Machines: A Survey
• Formalizing Turing Machines
• Turing machine and its symbolic simulation
• scientific article; zbMATH DE number 3900158 (Why is no real title available?)
• scientific article; zbMATH DE number 3907770 (Why is no real title available?)
• scientific article; zbMATH DE number 4049057 (Why is no real title available?)
• scientific article; zbMATH DE number 4072939 (Why is no real title available?)
• scientific article; zbMATH DE number 3521955 (Why is no real title available?)
• scientific article; zbMATH DE number 732055 (Why is no real title available?)
• scientific article; zbMATH DE number 1157791 (Why is no real title available?)
• scientific article; zbMATH DE number 1512850 (Why is no real title available?)
• Paper Machines
• Automata, Languages and Programming
• scientific article; zbMATH DE number 3267347 (Why is no real title available?)
• A New Hierarchy of Elementary Functions
• The unsolvability of the uniform halting problem for two state Turing machines
• New Computational Paradigms
• A Note on Computation MTs with Time in Instructions or with Tapes of Fixed Length
• A formalization of multi-tape Turing machines

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5535413)