Small weakly universal Turing machines

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

Documents Related by Co-Citation

13 On the time complexity of 2-tag systems and small universal turing machines – Damien Woods, Turlough Neary - 2006
12 P-completeness of cellular automaton Rule 110 – Turlough Neary, Damien Woods - 2006
11 Four Small Universal Turing Machines – Turlough Neary, Damien Woods - 2009
46 Universality in elementary cellular automata – M Cook - 2004
9 Small deterministic Turing machines – Manfred Kudlek - 1996
10 The uniform halting problem for generalized one state Turing machines – Gabor Hermann - 1968
24 Small universal Turing machines – On Small - 1996
23 A universal Turing machine with two internal states – Claude Elwood Shannon - 1956
16 Size and structure of universal Turing machines using Tag systems – M Minsky - 1962
14 A small fast universal Turing machine – Turlough Neary, Damien Woods - 2005
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
16 Universality of tag systems with P = 2 – J Cocke, M Minsky - 1964
389 A New Kind of Science – Stephen Wolfram - 2002
2 Frontier between decidablity and undecidablity: a survey – M Margenstern - 2000
3 On quasi-unilateral universal Turing machines – M Margenstern - 2001
6 polynomial time universal Turing machines – Small