Venus Mousetrap
Posts: 201 Joined: Aug. 2007
|
this is true by the way. the example is invented (but no less valid), but the program does exist. Quote |
12
Venus Mousetrap
02/14/2008
8:26 pm
Dr Dembski: I love the idea of conservation of information, but I’ve been having difficulty demonstrating it. I wrote a program which starts with a letter (’a') and then applies three kinds of random mutations (point, duplication, and deletion).
I’ll show you a quick example…
a aa (duplication) ab (point mutation) aba (duplication of just the first letter - it selects a random range to duplicate) abb (point) bb (deletion) bbbb (duplication) bdbb (point) bdbdbb (duplication of the ‘db’) bdb (deletion of the 3rd, 4th, 5th letters)
It makes a lovely string of characters, but I really feel I’m missing the point - these can’t be informationally equivalent can they? I mean, I haven’t yet found out how to calculate information, but if all these strings are equivalent, won’t any string be?
|
|