Registered: Jun 2004
Posts: 1

Hello!
Has anybody tried to find the smallest n whose bitsequence yields universal behavior of Rule 110?

Would this RULE110(n) eventually emulate all possible algorithms?

Since RULE110(n) only grows to the left, it lends itself to filling an adjancency matrix Q like the one proposed by Fotini Markopoulou and Lee Smolin in "Quantum Theory from Quantum Gravity", see http://arxiv.org/PS_cache/gr-qc/pdf/0311/0311059.pdf

Would the so defined network automatically generate Quantum mechanics if particles were defined by non-planarities in networks as Wolfram suggests on page 527 of NKS? As far as I understand the authors, the only thing necessary for the probability distribution of the Eigenvalues lambda_i in the mentioned approximation to behave according to the Schroedinger Equation is a stochastic fluctuation of the xia's. This could be caused by the fluctuation of the "center of gravity" of the non-planarity in the metric of the embedding space.

Hoping that all the question above can be answered yes: Would the so defined network not necessarily eventually emulate (or "be") our universe?

Another yes? In that case the search for the Grand Unified Theory becomes a something like a halting problem: What is the smallest n for which RULE(110) is universal?

Actually not even that is necessary: Any n will do that achieves universality. Also a universal Turing machine will do.

Holger Schlueter, Princeton

Report this post to a moderator | IP: Logged