Reply to comment

So this is, obviously, rather late and therefore some of what I'm about to say has been touched on in class, but I find it interesting nonetheless.

While I don't agree with Wolfman's idea that cellular automata can describe every system in the universe, the idea is definitely applicable to computers. Ultimately, computers can only operate in two states -- "on" or "off". Either electricity is flowing through a transistor or it's not. Transistors can then be put together in a certain way to make logic gates -- and, or, and not (and sometimes nor and xor). These gates are then put together to make latches, which are put together to make memory. They're also used for arithmetic operations, usually addition and subtraction, though most current computers also have division and multiplication built in (and sometimes loops). These gates and arithmetic operations make up the ALU, which works with the memory and the PC (I think short for "program counter" -- it dictates the order in which everything gets done) to make a processor.

My point (other than finally being able to use what I learned in Computer Orginization) is that the complex machienery I'm using right now to type this is made possible by objects with two states working under certain rules. This, at least, works with the idea of simple things creating incredibly complexity. Using these two states, we can make pretty much any calculation we want to, just like rule 110 in Wolfman's model.

Something to think about, anyway.