Talk:Blind

Computational class

This is obviously Turing-complete. Probably the simplest way to prove it is to just compile Turing machines into it directly; you can use unique arrangements of marked squares to represent the current tape position and state, and can perform any transition in two steps. --ais523 00:31, 29 October 2012 (UTC)