Well, this is interesting:
Evolution is deterministic, not random, biologists conclude from multi-species study from PhysOrg.com
A multi-national team of biologists has concluded that developmental evolution is deterministic and orderly, rather than random, based on a study of different species of roundworms. The findings are reported in the latest issue of the journal Current Biology.
[...]
I've got my mouse on the link to read the original paper, but CB is not delivering it. Something wrong with their server. But rest assured, I will get it, I will read it, I will blog it.
More like this
I've been seeing articles popping up all over the place about a recent
PLOS article called Order in Spontaneous Behavior. The majority of
Why is classical computing possible at all? A silly question, but one which never ceases to amaze me.
Last week, in the class I'm teaching, we talked about the basics of deterministic finite automata. In week two we moved on to more interesting and slightly less basic material.
Now that we've gone through a very basic introduction to computational complexity, we're ready
to take a high-level glimpse at some of the more interesting things that arise from it. The one
that you'll hear about most often is "P vs NP", which is what I'm going to write about today.
Another link to that paper:
http://www.sciencedaily.com/releases/2007/11/071119123929.htm