On machines, universal by extensions
From MaRDI portal
Publication:1349857
DOI10.1016/S0304-3975(96)00079-5zbMath0874.68104MaRDI QIDQ1349857
Publication date: 27 February 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items
The complexity of small universal Turing machines: A survey, Frontier between decidability and undecidability: A survey, The Complexity of Small Universal Turing Machines: A Survey, ON THE OPTIMAL NUMBER OF INSTRUCTIONS FOR UNIVERSAL TURING MACHINES CONNECTED WITH A FINITE AUTOMATON
Cites Work