Introduction
Dembski's home pages
Dembski Links
|
Evolutionary Algorithms
- 2001/06/07: Effect
of Ties on the Evolution of Information by the Ev program, by Tom
Schneider. Schneider experimentally tests Dembski's claim that fine-tuning
of code is necessary for the "ev" program to show an information
increase. Results: Dembski's claim fails.
- 2001/06/07: Rebuttal
to William A. Dembski's Posting, by Tom Schneider.
- 2001/06/05: MetaNexus
post by William A. Dembski. Dembski critiques Tom Schneider's "ev"
program as having "smuggled in" "complex specified
information".
- 2000/11: Summary of talk
titled "No Free Lunch" given by William A. Dembski at the 2000
Yale ID conference.
- EXPLAINING
SPECIFIED COMPLEXITY. Article from "reiterations" mailing
list.
- Specified
Complexity. A follow-up essay to "Explaining Specified
Complexity".
Other Sites Related to Evolutionary Algorithms
- Christoph Adami, Charles Ofria, and Travis C. Collier's Evolution
of biological complexity, Proc. Natl. Acad. Sci. USA, Vol. 97, Issue
9, 4463-4468, April 25, 2000.
To make a case for or against a trend in the evolution of complexity
in biological evolution, complexity needs to be both rigorously defined
and measurable. A recent information-theoretic (but intuitively evident)
definition identifies genomic complexity with the amount of information
a sequence stores about its environment. We investigate the evolution of
genomic complexity in populations of digital organisms and monitor in
detail the evolutionary transitions that increase complexity. We show
that, because natural selection forces genomes to behave as a natural
"Maxwell Demon," within a fixed environment, genomic
complexity is forced to increase.
|