Firing Squad Synchronization Problem

The firing squad synchronization problem is a problem in computer science and cellular automata in which the goal is to design a cellular automaton that, starting with a single active cell, eventually reaches a state in which all cells are simultaneously active. It was first proposed by John Myhill in 1957 and published (with a solution) in 1962 by Edward Moore.

Read more about Firing Squad Synchronization ProblemProblem Statement, Solutions, Generalizations

Other articles related to "firing squad synchronization problem, problem, firing squad, problems":

Firing Squad Synchronization Problem - Generalizations
... The firing squad synchronization problem has been generalized to many other types of cellular automaton, including higher dimensional arrays of cells (Shinahr 1974) ... Variants of the problem with different initial conditions have also been considered (Kobayashi Goldstein 2005) ... Solutions to the firing squad problem may also be adapted to other problems ...

Famous quotes containing the words problem, firing and/or squad:

    The general public is easy. You don’t have to answer to anyone; and as long as you follow the rules of your profession, you needn’t worry about the consequences. But the problem with the powerful and rich is that when they are sick, they really want their doctors to cure them.
    Molière [Jean Baptiste Poquelin] (1622–1673)

    Slowly, and in spite of anything we Americans do or do not do, it looks a little as if you and some other good people are going to have to answer the old question of whether you want to keep your country unshackled by taking even more definite steps to do so—even firing shots—or, on the other hand, submitting to be shackled for the sake of not losing one American life.
    Franklin D. Roosevelt (1882–1945)

    Americans think of themselves collectively as a huge rescue squad on twenty-four-hour call to any spot on the globe where dispute and conflict may erupt.
    Eldridge Cleaver (b. 1935)