Sökning: onr:"swepub:oai:research.chalmers.se:7753831a-59dd-4de5-93c3-aedc3ed18c64" >
Universal Computati...
Universal Computation in Simple One-Dimensional Cellular Automata
-
- Lindgren, Kristian, 1960 (författare)
- Chalmers tekniska högskola,Chalmers University of Technology
-
- Nordahl, Mats, 1958 (författare)
- Chalmers tekniska högskola,Chalmers University of Technology
-
(creator_code:org_t)
- 1990
- 1990
- Engelska.
-
Ingår i: Complex Systems. - 0891-2513. ; 4:3, s. 299-318
- Relaterad länk:
-
https://research.cha...
Abstract
Ämnesord
Stäng
- The existence of computation-universal one-dimensional cellular automata with seven states per cell for a transition function depending on the cell itself and its nearest neighbors (r= 1), and four states per cell for r= 2 (when next-nearest neighbors also are included), is shown. It is also demonstrated that a Turing machine with m tape symbols and n internal states can be simulated by a cellular automaton of range r= 1 with m+ n+ 2 states per cell.
Ämnesord
- NATURVETENSKAP -- Matematik -- Beräkningsmatematik (hsv//swe)
- NATURAL SCIENCES -- Mathematics -- Computational Mathematics (hsv//eng)
Publikations- och innehållstyp
- art (ämneskategori)
- ref (ämneskategori)
Hitta via bibliotek
Till lärosätets databas