Twin-period recurrence conjecture for reversible elementary cellular automaton 115
Statement
Let reversible elementary second-order cellular automaton 115 (RESOCA 115) have finite configurations with periods. Two periods and are called twins.
Twin-period recurrence conjecture. Assume that and are twin periods. Then the next twin pair is and , where
This conjecture proposes a recurrence for the experimentally observed twin periods of finite configurations of RESOCA 115; the source states that the authors do not know whether all periods are twins and presents the recurrence as a pattern suggested by experiments.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.