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:
“To higher or lower ends, they [the majority of mankind] move too often with something of a sad countenance, with hurried and ignoble gait, becoming, unconsciously, something like thorns, in their anxiety to bear grapes; it being possible for people, in the pursuit of even great ends, to become themselves thin and impoverished in spirit and temper, thus diminishing the sum of perfection in the world, at its very sources.”
—Walter Pater (1839–1894)
“Consciousness is what makes the mind-body problem really intractable.”
—Thomas Nagel (b. 1938)