The Definition of Universal Turing Machine

DOI10.2307/2032691MaRDI QIDQ3253794zbMATH OpenOpenAlexFDO

Authors Martin Davis

Publication date 1958

Full work available at URL https://doi.org/10.2307/2032691

zbMATH Keywords

philosophy and foundations of mathematics

Cited in

(10)

• Small universal Turing machines
• The origins of the halting problem
• Behavioral complexity indicators for process algebra: The NKS approach
• Honest universality
• My Life as a Logician
• Honest computability and complexity
• On Goles' universal machines: a computational point of view
• On centain decompositions of Gödel numberings
• On Universal Functions
• Three small universal spiking neural P systems

This page was built for publication: The Definition of Universal Turing Machine

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