A universal machine without change of state

DOI10.1016/0304-3975(87)90105-8zbMath0641.68073OpenAlexW2076250740MaRDI QIDQ1100903

Jean-Philippe Lehmann

Publication date: 1987

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(87)90105-8

zbMATH Keywords

Turing machinessymbolsmodel of computationuniversal machine

Mathematics Subject Classification ID

Turing machines and related notions (03D10)

Cites Work

• Unnamed Item
• Unnamed Item
• A Mathematical Theory of Communication
• General recursive functions of natural numbers
• ON A SIMPLE COMBINATORIAL STRUCTURE SUFFICIENT FOR SYBLYING NONTRIVIAL SELF-REPRODUCTION
• Overlapping algorithms
• On Computable Numbers, with an Application to the Entscheidungsproblem
• Formal Reductions of the General Combinatorial Decision Problem

This page was built for publication: A universal machine without change of state