User blog comment:Deedlit11/Googology in Magic: the Gathering/@comment-5150073-20130412144609

If there are finite number of cards (analogs to states in TM), then how there are can be Turing completeness? As far as I know, no programmable game can't attain Turing completeness, because it is already programmed in the finite-state program language.

PS: In googology, we're consider that any number larger than 1 is larger (each large number has its small reciprocal).