8 papers
Hierarchical Complexity of Finite Groups
Chrystopher L. Nehaniv
What are simplest ways to construct a finite group from its atomic constituents? To understand part-whole relations between finite simple groups and the global structure of finite…
Spatial Iterated Prisoner's Dilemma as a Transformation Semigroup
Isaiah Farahbakhsh, Chrystopher L. Nehaniv
The prisoner's dilemma (PD) is a game-theoretic model studied in a wide array of fields to understand the emergence of cooperation between rational self-interested agents. In this…
Algebraic Structure of the Varikon Box
Jason d'Eon, Chrystopher L. Nehaniv
The 15-Puzzle is a well studied permutation puzzle. This paper explores the group structure of a three-dimensional variant of the 15-Puzzle known as the Varikon Box, with the goal…
Algebraic Structure and Complexity of Bootstrap Percolation with External Inputs
Saptarshi Pal, Chrystopher L. Nehaniv
In this paper a modification of the standard Bootstrap Percolation model is introduced. In our modification a discrete time update rule is constructed that allows for non-monotonic…
Exploring Tetris as a Transformation Semigroup
Peter C. Jentsch, Chrystopher L. Nehaniv
Tetris is a popular puzzle video game, invented in 1984. We formulate two versions of the game as a transformation semigroup and use this formulation to view the game through the l…
Measuring Time with Minimal Clocks
Andrei D. Robu, Christoph Salge, Chrystopher L. Nehaniv +1
Being able to measure time, whether directly or indirectly, is a significant advantage for an organism. It allows for the timely reaction to regular or predicted events, reducing t…