TOPICS
Search

Rule 30 Prize Problems


The Rule 30 prize problems are three questions about the central column of rule 30 started from a single black cell on an otherwise white infinite line. Wolfram (2019) announced a prize of $10,000 for the resolution of each question.

Let c_n be 1 if the central cell is black after n steps and 0 otherwise, so c_0=1. The questions are

1. Is the sequence {c_n} not eventually periodic?

2. Do black and white cells have equal limiting frequencies in the central column, that is, does the limit satisfy

 lim_(n->infty)1/nsum_(j=0)^(n-1)c_j=1/2?

3. Does computing c_n necessarily require at least linear computation time in n?

The third question concerns computational irreducibility. Jen's (1990) result for two adjacent cells does not establish the corresponding claim for the central column alone.


See also

Computational Irreducibility, Rule 30

Explore with Wolfram|Alpha

WolframAlpha

More things to try:

References

Jen, E. "Aperiodicity in One-Dimensional Cellular Automata." Physica D 45, 3-18, 1990.Wolfram, S. "Announcing the Rule 30 Prizes." Oct. 1, 2019. https://writings.stephenwolfram.com/2019/10/announcing-the-rule-30-prizes/.

Cite this as:

Weisstein, Eric W. "Rule 30 Prize Problems." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/Rule30PrizeProblems.html

Subject classifications