#computability

[dambiex]

ok so basically understanding a joke takes polynomial time while making a joke takes exponential time (probably)

[m---a---x]

Inspired by all the newly created communities i have also created one about the topic closest to my heart: Foundational Mathematics

It is inteded for all types of posts about and from people of all kinds of backgrounds interested in the topic.

Please share with anyone you think might be interested. If you want to be added comment on this post, so I can add you.

[jadagul]

Since you're posting on the twin primes MTG combo: am I correct in thinking it was already possible to create a game state where the winner depended on whether the twin primes conjecture is true, due to the fact that you can establish a Turing machine in MTG? (Zimone, All Questioning just makes it simpler to do this, at the cost of making the relevance of the twin primes conjecture come in via game theory rather than just via resolving the rules.)

That does seem to be the case. Having now skimmed the paper, that's a much stronger result, because neither player ever has any choices to make. If you feed it a Turing machine that halts when it runs out of twin primes, which I think you can construct, then Alice wins if the Twin Prime conjecture is false and the game draws if the Twin Prime conjecture is true.

[hydraceous]

just learned that the set of computable reals is countable and I am filled with revulsion

[fuzzyghost]

[retrocgads]

USA 1984

[tariqk]

This is an amazing introduction to an idea that still messes me up to this day.

And to top it off, this extra section talks about how not only does this model have this attractor state, but, well, you can make a Turing Machine out of it:

Which messes me up even more.