Efficient unidimensional universal cellular automaton
In this paper we present an intrinsically universal one dimensional cellular automaton. By intrinsic, we mean that it does not simulate a universal Turing machine, which is a well-known result, but it simulates any other cellular automaton on any input. We thus improve the complexities in time and in space of the intrinsically universal cellular automaton of J. Albert and K. Culik, and we give notions of what a parallel computation is for one dimensional cellular automata.
KeywordsCellular Automaton Turing Machine Initial Configuration Recursive Function Universal Computation
Unable to display preview. Download preview PDF.
- Alvin Ray Smith III. Real-time language recognition by one-dimensional cellular automata. Journal of Computer and System Sciences, 6:233–253, 1971.Google Scholar
- M. Machtey and P. Young. An introduction to the general theory of algorithms. Theory of computation series, North Holland, 1978.Google Scholar
- Bruno Martin. Intrinsic universal computation of one dimensional cellular automata. In Center for Scientific Computing Helsinki, editor, Workshop on Cellular Automata, April 1991.Google Scholar
- Bruno Martin. A universal cellular automaton in quasi-linear time and its S-m-n form. Research report 91-21, Laboratoire de l'informatique du Parallélisme, 1991. Submitted to Theoretical Computer Science.Google Scholar
- R. Sommerhadler and S.C. van Westrhenen. The Theory of Computability, Programs, Machines, Effectiveness and Feasibility. Addison Wesley, 1988.Google Scholar