On computational irreducibility and the predictability of complex physical systems

Details On computational irreducibility and the predictability of complex physical systems On computational irreducibility and the predictability of complex physical systems

2003-09-17

arxiv.org/abs/nlin/0309047v2

Nonlinear Sciences

Cellular Automata and Lattice Gases

4 pages, 2 figures, to be published in PRL

Scientific paper

10.1103/PhysRevLett.92.074105

Using elementary cellular automata (CA) as an example, we show how to coarse-grain CA in all classes of Wolfram's classification. We find that computationally irreducible (CIR) physical processes can be predictable and even computationally reducible at a coarse-grained level of description. The resulting coarse-grained CA which we construct emulate the large-scale behavior of the original systems without accounting for small-scale details. At least one of the CA that can be coarse-grained is irreducible and known to be a universal Turing machine.

Affiliated with

Also associated with

No associations

Rating

On computational irreducibility and the predictability of complex physical systems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On computational irreducibility and the predictability of complex physical systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On computational irreducibility and the predictability of complex physical systems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-137822