[kbenson]

> The author admits he has constructed an artificial scenario under which a Turing Machine is generated. This is exactly the same as using the rules of MtG as a notation to create a machine.

An artificial scenario which is achievable under normal play, and the only variation required by the human players being that when offered a choice, they choose affirmative.

> A generalized set of the rules for the game Go is Turing Complete. A generalized set of the rules for the game Go Fish is Turing Complete.

Do you have references for those? I would be interested in seeing how they simulated the tape.