  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.
