RSS 2.0 Feed

» Welcome Guest Log In :: Register

Pages: (1000) < [1] 2 3 4 5 6 ... >   
  Topic: Official Uncommonly Dense Discussion Thread< Next Oldest | Next Newest >  
Venus Mousetrap



Posts: 201
Joined: Aug. 2007

(Permalink) Posted: Feb. 14 2008,19:41   

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?

  
  29999 replies since Jan. 16 2006,11:43 < Next Oldest | Next Newest >  

Pages: (1000) < [1] 2 3 4 5 6 ... >   


Track this topic Email this topic Print this topic

[ Read the Board Rules ] | [Useful Links] | [Evolving Designs]