Re:Magic: The Gathering is Turing Complete
by lmkg on Tuesday May 07, 2019 @08:49AM
(#19848866)
The output of a computer program can be unsolveable, even though the source of the program has finite characters. It's the same thing. (Literally: you're building an interpreter out of cards.)
[ Parent
| on HN ]
There are no comments on this comment yet.