The following pages link to Some undecidable determined games (Q1171511):
Displaying 9 items.
- Modular Nim (Q673073) (← links)
- What can and cannot be done with Diophantine problems (Q741171) (← links)
- Epidemiography. II: Games with a dozing yet winning player (Q1106113) (← links)
- Computability and randomness of Nash equilibrium in infinite games (Q1177225) (← links)
- Computational complexity of winning strategies in two-person polynomial games (Q1190954) (← links)
- Computability, complexity and economics (Q1318305) (← links)
- Complexity, appeal and challenges of combinatorial games (Q1884999) (← links)
- The complexity of recursion theoretic games (Q5694972) (← links)
- From undecidability of non-triviality and finiteness to undecidability of learnability (Q6064265) (← links)
