33 citations · 36 across the 3 of their papers we have counts for
5 papers
Small tile sets that compute while solving mazes
Matthew Cook, Tristan Stérin, Damien Woods
We ask the question of how small a self-assembling set of tiles can be yet have interesting computational behaviour. We study this question in a model where supporting walls are pr…
A Cellular Automaton for Blocking Queen Games
Matthew Cook, Urban Larsson, Turlough Neary
We show that the winning positions of a certain type of two-player game form interesting patterns which often defy analysis, yet can be computed by a cellular automaton. The game,…
Proceedings Machines, Computations and Universality 2013
Turlough Neary, Matthew Cook
This volume contains the papers presented at the 6th conference on Machines, Computations and Universality (MCU 2013). MCU 2013 was held in Zurich, Switzerland, September 9-11, 201…
A Concrete View of Rule 110 Computation
Matthew Cook
Rule 110 is a cellular automaton that performs repeated simultaneous updates of an infinite row of binary values. The values are updated in the following way: 0s are changed to 1s…
Tournament Sequences and Meeussen Sequences
Matthew Cook, Michael Kleber
A "tournament sequence" is an increasing sequence of positive integers (t_1,t_2,...) such that t_1=1 and t_{i+1} <= 2 t_i. A "Meeussen sequence" is an increasing sequence of positi…