4.3 Computational Mechanics of Cellular Automata

@inproceedings{43CM,
  title={4.3 Computational Mechanics of Cellular Automata},
  author={}
}
    Why does 1d , for example, perform relatively well on the c = 1=2 task? In Figure 1(d) it can be seen that, although the patterns eventually converge to xed points, there is a transient phase during which a spatial and temporal transfer of information about the density in local regions takes place. This local information interacts with other local information to produce the desired nal state. Roughly 1d successively classiies \local" densities with a locality range that increases with time. In… CONTINUE READING
    27 Citations
    14 References
    Similar Papers

    References

    Publications referenced by this paper.
    Showing 1-10 of 14 references

    The calculi of emergence: Computation, dynamics, and induction

    • J P Crutchheld
    • Physica D
    • 1994

    The evolution of emergent computation

    • J P Crutchheld, M Mitchell
    • Science
    • 1994

    The emergent logic of the Gacs-Kurdyumov-Levin cellular automaton

    • J P Crutchheld
    • The emergent logic of the Gacs-Kurdyumov-Levin…
    • 1993

    Artiicial Life II. Santa Fe Institute Studies in the Sciences of Complexity

    • C G Langton, C Taylor, J D Farmer, S Rasmussen
    • Artiicial Life II. Santa Fe Institute Studies in…
    • 1992

    Similar Papers

    Loading similar papers…