A dynamical system is said to be computationally universal if it can b
e programmed through its initial condition to perform any digital comp
utation. Such systems include traditional abstract computers such as T
uring machines and cellular automata, as well as more physical models
such as hard sphere gases and even a single particle in an appropriate
ly shaped box. Because of the ability of any two such systems to simul
ate one another, they are all equivalent in the range of computations
they can perform; and the global dynamics of any one of them provides
a microcosm of all cause/effect relations that can be expressed by ded
uctive logic or numerical simulation. This allows universal computers
to be used to define in an objective manner that sort of complexity wh
ich increases when a self-organizing system organizes itself.