> 1. Feeding infinite HTML is not the same as feeding > tape. A million tape cells can keep a typical Turing > machine running indefinitely. A million row

> 1. Feeding infinite HTML is not the same as feeding > tape. A million tape cells can keep a typical Turing > machine running indefinitely. A million rows only keep > this running for a million execution steps There are read-only systems that are considered Turing Complete. They also work by concatenating new data (of potentially unbounded size) at each computation step. For example, a one-dimensional cellular automaton called Rule 110: https://en.wikipedia.org/wiki/Rule_110 https://en.wikipedia.org/wiki/Rule_110 . The fact that traditional Turing Machines reclaim storage is an implementation detail, not anything fundamental to Turing Completeness or computer science.