Reference library
A Simple Universal Cellular Automaton and its One-Way and Totalistic Version
Paper summary
Constructs one-way and totalistic normal forms for one-dimensional cellular automata, then encodes them in a small universal cellular automaton with fourteen states. The result concerns simulation of other computations through suitable initial encodings.
Relevance to the project
Shows that restrictive local primitives can retain computational expressiveness. Useful when assessing the foundational building block, without requiring a complex primitive set solely for universality.
Universality does not establish efficient computation or spontaneous useful behavior.
Source record
- Reference ID
- pdf-https-content-wolfram-com-sites-13-2018-02-01-1-1-pdf
- Archived version
- Direct PDF cited in project notes; publication status needs source-specific inspection
- Summary provenance
- reference-library/papers/pdf-https-content-wolfram-com-sites-13-2018-02-01-1-1-pdf/metadata.json · summary
- Review status
- initial orientation summary; not a critical full-paper review
- Reading scope
- Selected abstract/opening and available closing discussion/conclusion passages in the preserved text extract; broader project notes provide context. No reproduction of experiments, exhaustive methods review, or equation/figure audit.