On machines, universal by extensions

DOI10.1016/S0304-3975(96)00079-5zbMath0874.68104MaRDI QIDQ1349857

Liudmila Pavlotskaya

Publication date: 27 February 1997

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

Mathematics Subject Classification ID

Related Items (4)

The Complexity of Small Universal Turing Machines: A Survey ⋮ ON THE OPTIMAL NUMBER OF INSTRUCTIONS FOR UNIVERSAL TURING MACHINES CONNECTED WITH A FINITE AUTOMATON ⋮ The complexity of small universal Turing machines: A survey ⋮ Frontier between decidability and undecidability: A survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On machines, universal by extensions