Some undecidable determined games

DOI10.1007/BF01769063zbMath0498.90090MaRDI QIDQ1171511

S. Singh

Publication date: 1982

Published in: International Journal of Game Theory (Search for Journal in Brave)

zbMATH Keywords

existence of winning strategiesexistence of special prime numbersstrictly determined undecidable games

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) 2-person games (91A05)

Related Items (9)

Complexity, appeal and challenges of combinatorial games ⋮ Epidemiography. II: Games with a dozing yet winning player ⋮ From undecidability of non-triviality and finiteness to undecidability of learnability ⋮ The complexity of recursion theoretic games ⋮ Computability and randomness of Nash equilibrium in infinite games ⋮ Modular Nim ⋮ Computational complexity of winning strategies in two-person polynomial games ⋮ What can and cannot be done with Diophantine problems ⋮ Computability, complexity and economics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The decision problem for exponential diophantine equations
• Three universal representations of recursively enumerable sets
• An application of games to the completeness problem for formalized theories
• Classification of Quantifier Prefixes Over Diophantine Equations
• Recursive Undecidability--An Exposition
• Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I
• On the axiom of determinateness
• Recursively enumerable sets of positive integers and their decision problems

This page was built for publication: Some undecidable determined games