P-completeness of cellular automaton rule 110

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4051 LNCS, Issue , 2006, Pages 132-143

  Neary, Turlough ^a   Woods, Damien ^b  

^a NATIONAL UNIVERSITY OF IRELAND   (Ireland)

^b UNIVERSITY COLLEGE CORK   (Ireland)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER PROGRAMMING; POLYNOMIALS; TURING MACHINES;

CELLULAR AUTOMATON; POLYNOMIAL TIME;

AUTOMATA THEORY;

EID: 33746363533     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11786986_13     Document Type: Conference Paper

References (17)

1. Wolfram, S.: Statistical mechanics of cellular automata. Reviews of Modern Physics 55 (1983) 601-644
2. Cook, M.: Universality in elementary cellular automata. Complex Systems 15 (2004) 1-40
3. Cocke, J., Minsky, M.: Universality of tag systems with P = 2. Journal of the ACM 11 (1964) 15-20
4. Rogozhin, Y.: Small universal Turing machines. TCS 168 (1996) 215-240
5. Baiocchi, C.: Three small universal Turing machines. In Margenstern, M., Rogozhin, Y., eds.: Machines, Computations, and Universality, Volume 2055 of LNCS., Chişinǎu, Moldova, MCU, Springer (2001) 1-10
6. Kudlek, M., Rogozhin, Y.: A universal Turing machine with 3 states and 9 symbols. In Knich, W., Rozenberg, G., Salomaa, A., eds.: Developments in Language Theory (DLT) 2001. Volume 2295 of LNCS., Vienna, Springer (2002) 311-318
7. Minsky, M.: Size and structure of universal Turing machines using tag systems. In: Recursive Function Theory, Symp. in Pure Math. Volume 5., AMS (1962) 229-238
8. Neary, T., Woods, D.: A small fast universal Turing machine. Technical Report NUIM-CS-TR-2005-12, Dept. of Computer Science, NUI Maynooth (2005)
9. Neary, T., Woods, D.; Small fast universal Turing machines, TCS (To appear.)
10. Greenlaw, R., Hoover, H.J., Ruzzo, W.L.: Limits to parallel computation; P-completeness theory. Oxford university Press, Oxford (1995)
11. Lindgren, K., Nordahl, M.G.: Universal computation in simple one-dimensional cellular automata. Complex Systems 4 (1990) 299-318
12. Ollinger, N.: The quest for small universal cellular automata. In Widmayer, P., et al., eds.: International Colloquium on Automata, Languages and Programming (ICALP). Volume 2380 of LNCS., Malaga, Spain, Springer (2002) 318-329
13. Moore, C.: Majority-vote cellular automata, Ising dynamics and P-completeness. Journal of Statistical Physics 88 (1997) 795-805
14. Moore, C.: Quasi-linear cellular automata. Physica D 103 (1997) 100-132
15. Moore, C.: Predicting non-linear cellular automata quickly by decomposing them into linear ones. Physica D 111 (1998) 27-41
16. Aaronson, S.: Book review: A new kind of science. Quantum Information and Computation 2 (2002) 410-423
17. Hopcroft, J.E., Ullman, J.D.: Introduction to automata theory, languages, and computation. Addison-Wesley (1979)