The laterality problem for non-erasing Turing machines on $\lbrace 0,1\rbrace $ is completely solved
From MaRDI portal
Publication:4349780
DOI10.1051/ita/1997310201591zbMath0878.68063OpenAlexW85833935MaRDI QIDQ4349780
Publication date: 25 August 1997
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/92557
Related Items
The Complexity of Small Universal Turing Machines: A Survey, Wang's B machines are efficiently universal, as is Hasenjaeger's small universal electromechanical toy, The complexity of small universal Turing machines: A survey, Maurice Margenstern’s Contributions to the Field of Small Universal Turing Machines, Frontier between decidability and undecidability: A survey
Cites Work