# The Mazoyer Firing Squad

Requires a Wolfram Notebook System

Interact on desktop, mobile and cloud with the free Wolfram Player or other Wolfram Language products.

Page 65 of Feynman's *Lectures on Computation* introduces a problem of message passing. A 1D line of cells can only influence neighbors to each side. One cell is turned on, and all cells must reach an identical "firing" state. The nearest-neighbor character of this problem makes it soluble by means of cellular automata. This Demonstration uses a 7-color rule that would be about in base 10 (see the program for the exact value).

Contributed by: Brad Klee (June 2012)

Open content licensed under CC BY-NC-SA

## Snapshots

## Details

References

[1] R. P. Feynman, *Lectures on Computation*, Boulder, CO: Westview Press, 1996.

[2] S. Wolfram, *A New Kind of Science*, Champaign, IL: Wolfram Media, 2002 p. 1035.

[3] Wikipedia. "Firing Squad Synchronization Problem." (Nov 26, 2012) en.wikipedia.org/wiki/Firing_squad_synchronization _problem.

## Permanent Citation