Majority Problem (cellular Automaton)
The majority problem, or density classification task is the problem of finding one-dimensional cellular automaton rules that accurately perform majority voting.
Using local transition rules, cells cannot know the total count of all the ones in system. In order to count the number of ones (or, by symmetry, the number of zeros), the system requires a logarithmic number of bits in the total size of the system. It also requires the system send messages over a distance linear in the size of the system and for the system to recognize a non-regular language. Thus, this problem is an important test case in measuring the computational power of cellular automaton systems.
Read more about Majority Problem (cellular Automaton): Problem Statement, Approximate Solutions, Impossibility of A Perfect Classifier, Exact Solution With Alternative Termination Conditions
Famous quotes containing the words majority and/or problem:
“Oh, how desperately bored, in spite of their grim determination to have a Good Time, the majority of pleasure-seekers really are!”
—Aldous Huxley (1894–1963)
“A serious problem in America is the gap between academe and the mass media, which is our culture. Professors of humanities, with all their leftist fantasies, have little direct knowledge of American life and no impact whatever on public policy.”
—Camille Paglia (b. 1947)