Paper: Magic: The Gathering is Turing Complete, Round 2
This paper builds on the previous work of building a Turing machine inside the game by proving that the algorithm to determine the winning strategy is noncomputable.
News coverage: https://www.technologyreview.com/s/613489/magic-the-gathering-is-officially-the-worlds-most-complex-game/amp/
Why is this step necessary? hellsite.tyronesama.moe might not be the server where you are registered, so we need to redirect you to your home server first.
Don't have an account? You can sign up here