Impartial Games and Recursive Functions
Doktorsavhandling, 2013
Turing complete
Heap game
Splitting sequences
Rule 110
Game complexity
Dual game
Invariant subtraction game
Cellular automaton
P-equivalence
Impartial game
Beatty sequences
Take-away game
Blocking maneuver
Comply maneuver
Complementary sequences
Nim
Game reflexivity
Move-size dynamic
Dictionary process
*-operator
Algorithmically undecidable
Wythoff Nim
Game convergence
Subtraction game
Författare
Urban Larsson
Göteborgs universitet
Chalmers, Matematiska vetenskaper, Matematik
The star-operator and invariant subtraction games
Theoretical Computer Science,;Vol. 422(2012)p. 52-58
Artikel i vetenskaplig tidskrift
Blocking Wythoff Nim
Electronic Journal of Combinatorics,;Vol. 18(2011)p. 18-18
Artikel i vetenskaplig tidskrift
Invariant and dual subtraction games resolving the Duchene-Rigo conjecture
Theoretical Computer Science,;Vol. 412(2011)p. 729-735
Artikel i vetenskaplig tidskrift
2-Pile Nim With a Restricted number of Move-size Imitations (with an appendix by Peter Hegarty)
Integers Journal,;Vol. 9(2009)p. 671-690
Artikel i vetenskaplig tidskrift
Impartial games emulating one-dimensional cellular automata and undecidability
Journal of Combinatorial Theory - Series A,;Vol. 120(2013)p. 1116-1130
Artikel i vetenskaplig tidskrift
From heaps of matches to the limits of computability
Electronic Journal of Combinatorics,;Vol. 20(2013)p. Paper 41-
Artikel i vetenskaplig tidskrift
Ämneskategorier
Diskret matematik
ISBN
978-91-7385-843-4
Doktorsavhandlingar vid Chalmers tekniska högskola. Ny serie: 3524
Pascal
Opponent: Professor Vladimir Gurvich