A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
A universal cellular automaton in quasi-linear time and its S—m—n form
1994
Theoretical Computer Science
Abstruct Martin, B., A universal cellular automaton in quasi-linear time and its S-m-n form, Theoretical Computer Science 123 (1994) 199-237. In this paper, we describe a quasi-linear time universal cellular automaton. This cellular automaton is not only computation universal (in the sense of simulating any Turing machine), but also intrinsically universal (it is capable of simulating arbitrary one-dimensional cellular automata, even two-way). The simulation is based on a novel programming
doi:10.1016/0304-3975(92)00076-4
fatcat:m7t57xxt7ngv7gauqx2loetmhq