Simplest Universal Turing Machine Proved
A twenty-year-old undergraduate student has claimed a $25,000 prize for proving that a very simple machine can be programmed to do anything that a computer can do. The machine is a cellular automaton, with a particular set of rules describing how it should use colored squares to decide how to color other squares. It changes between two states that decide how to color squares in three colors. That's all it is, and theoretically, with the right squares to start with, and peripherals, it could run Windows Vista.
As this article points out, what this means is that the simplest conditions are conducive to extraordinarily complex behavior. The universe is teaming with life.