The Definition of Universal Turing Machine

DOI10.2307/2032691zbMath0084.01003OpenAlexW4210818952MaRDI QIDQ3253794

Martin Davis

Publication date: 1958

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

zbMATH Keywords

philosophy and foundations of mathematics

Related Items (10)

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

Cites Work

• Unnamed Item

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