Prof. Sch\"onhage's Mysterious Machines
Artificial Intelligence
2021-08-20 v1 Formal Languages and Automata Theory
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.
Cite
@article{arxiv.2108.08606,
title = {Prof. Sch\"onhage's Mysterious Machines},
author = {J. -M. Chauvet},
journal= {arXiv preprint arXiv:2108.08606},
year = {2021}
}
Comments
5 pages, 3 figures