Small weakly universal Turing machines

by Turlough Neary , Damien Woods
Citations:7 - 4 self

Documents Related by Co-Citation

16 On the time complexity of 2-tag systems and small universal turing machines – Damien Woods, Turlough Neary - 2006
75 Universality in elementary cellular automata – M Cook
21 P-completeness of cellular automaton Rule 110 – Turlough Neary, Damien Woods - 2006
27 Small universal Turing machines – On Small - 1996
11 Small deterministic turing machines – M Kudlek - 1996
15 A small fast universal Turing machine – Turlough Neary, Damien Woods - 2005
13 Four Small Universal Turing Machines – Turlough Neary, Damien Woods - 2009
10 Small semi-weakly universal Turing machines – Turlough Neary - 2007
19 Three Small Universal Turing Machines – C Baiocchi
18 Small universal register machines – I Korec - 1996
10 The uniform halting problem for generalized one state Turing machines – Gabor Hermann - 1968
8 Solvability of the halting problem for certain classes of Turing machines – Liudmila Pavlotskaya - 1973
9 A universal Turing machine with 3 states and 9 symbols – Manfred Kudlek, Yurii Rogozhin - 2002
8 Dostatochnye uslovija razreshimosti problemy ostanovki dlja mashin T’juring. Problemi kibernetiki – Liudmila Pavlotskaya - 1978
6 On the optimal number of instructions for universality of Turing machines connected with a finite automaton – Maurice Margenstern, Liudmila Pavlotskaya - 2003
20 Universality of Tag Systems With P = 2 – J Cocke, M Minsky - 1964
18 Size and Structure of universal Turing Machines Using Tag Systems – M L Minsky - 1962
29 A Universal Turing Machine with Two Internal States. Automata Studies – Claude E Shannon - 1956
6 2008): A particular universal cellular automaton – Nicolas Ollinger, Gaétan Richard