Original URL: https://news.ycombinator.com/item?id=20256681
Linus Torvalds: I really was hoping that we’d continue to have an increasingly quiet and shrinking rc series. But that was not to be.
Enlarge / Assemble just the right deck, and draw just the right cards, and you’ll get the equivalent of a universal Turing machine within the game, a new study finds. That makes it the most computationally complex real-world game yet known. (credit: Gordon Chibroski/Portland Press Herald/Getty Images)
Consider this hypothetical scenario: Bob and Alice are playing a game of Magic: The Gathering. It’s normal game play at first, as, say, Filigree robots from Kaladesh face off against werewolves and vampires from Innistrad. But then Alice draws just the right card from her customized deck, and suddenly Bob finds himself caught in the equivalent of a Turing machine, the famed abstract device that can simulate any computer algorithm. Thanks to the peculiarities of the rules of Magic, Bob can now only finish the game when he meets whatever condition Alice has programmed her in-game algorithm to accomplish—for example, to find a