Prof. Sch\"onhage's Mysterious Machines
J.-M. Chauvet
TL;DR
This paper presents a simplified version of Sch"onhage's Storage Modification Machine that can simulate one step of the Rule 110 cellular automaton, offering an alternative proof of the machine's Turing completeness.
Contribution
It introduces a straightforward construction of Sch"onhage's machine capable of simulating cellular automaton steps, simplifying the original proof of Turing completeness.
Findings
The machine can simulate one iteration of Rule 110.
Provides an alternative proof of Turing completeness.
Simplifies understanding of Sch"onhage's machines.
Abstract
We give a simple Sch\"onhage Storage Modification Machine that simulates one iteration of the Rule 110 cellular automaton. This provides an alternative construction to Sch\"onhage's original proof of the Turing completeness of the eponymous machines.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCellular Automata and Applications · Computability, Logic, AI Algorithms · Mathematical Dynamics and Fractals