Prof. Schönhage's Mysterious Machines
arXiv:2108.08606
Abstract
We give a simple Schönhage Storage Modification Machine that simulates one iteration of the Rule 110 cellular automaton. This provides an alternative construction to Schönhage's original proof of the Turing completeness of the eponymous machines.
5 pages, 3 figures