Impartial games emulating one-dimensional cellular automata and undecidability

DOI10.1016/j.jcta.2013.02.009zbMath1288.91029arXiv1201.1039OpenAlexW2963868236MaRDI QIDQ385042

Urban Larsson

Publication date: 29 November 2013

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1201.1039

zbMATH Keywords

undecidabilitycellular automatonPascal triangleimpartial gamerule 110rule 60take-away gametriangle-placing games

Mathematics Subject Classification ID

2-person games (91A05) Cellular automata (computational aspects) (68Q80) Combinatorial games (91A46)

Related Items (3)

From heaps of matches to the limits of computability ⋮ A cellular automaton for blocking queen games ⋮ Unnamed Item

Cites Work

• From heaps of matches to the limits of computability
• The \(\star\)-operator and invariant subtraction games
• Blocking Wythoff Nim
• Lattice games without rational strategies
• Computation theory of cellular automata
• 2-Pile Nim with a Restricted Number of Move-Size Imitations
• Playing Games with Algorithms: Algorithmic Combinatorial Game Theory
• A mathematical investigation of games of “take-away”
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Impartial games emulating one-dimensional cellular automata and undecidability