A two-dimensional variant of this model found in the game of life is known as Langton's ant.
A two-dimensional variant of this model found in the game of life is known as Langton's ant. Savitch's theorem guarantees that adding non-determinism to these entities does not improve their ability to save space. For partial functions, Rice's theorem states that these items cannot find their non-trivial properties in a finite amount of time. Their namesake showed that the halting problem for them is undecidable. A thesis partially named for Alonzo (*) Church states that all reasonable models of computation can be simplified to this one. Consisting of a read-write head and a finite state machine, it is able to manipulate symbols on an infinite tape. For 10 points, name this model of computation developed by a namesake British computer scientist.
A two-dimensional variant of this model found in the game of life is known as Langton's ant.
Turing machines