Cambios
De CreacionWiki
Página creada con '==En la traducción== El '''weasel program''' o '''weasel de Dawkins''', es un experimento de pensamiento y una variedad de simulaciones por ordenador que ilustran esto. <!-- ...'
==En la traducción==
El '''weasel program''' o '''weasel de Dawkins''', es un experimento de pensamiento y una variedad de simulaciones por ordenador que ilustran esto.
<!--
The thought experiment was formulated by [[Richard Dawkins]], and the first simulation was written by him; various other implementations of the program have been written by others. Dawkins made a disclaimer noting that this experiment was not intended to show how real evolution works, but to attempt to show the improvement gained by a selection mechanism in an evolutionary process. Dawkins acknowledged that to some extent his model is "misleading in important ways".<ref>{{cite book|author=Spetner, Lee M|authorlink=Lee Spetner|title=Not by Chance!|subtitle=Shattering the Modern Theory of Evolution|publisher=Judaica Press|pages=272|page=168|year=1997|isbn=978-1-88058224-4|location=Brooklin, New York}}</ref>
== Overview<ref>The authors of this section are the authors of the Wikipedia article as in [http://en.wikipedia.org/wiki/Weasel_program Weasel program]</ref> ==
In chapter 3 of his book ''[[The Blind Watchmaker]]'', Dawkins gave the following introduction to the program, referencing the well-known [[infinite monkey theorem]]:
{{quote|I don't know who it was first pointed out that, given enough time, a monkey bashing away at [[Randomness|random]] on a typewriter could produce all the works of Shakespeare. The operative phrase is, of course, given enough time. Let us limit the task facing our monkey somewhat. Suppose that he has to produce, not the complete works of Shakespeare but just the short sentence 'Methinks it is like a weasel', and we shall make it relatively easy by giving him a typewriter with a restricted keyboard, one with just the 26 (capital) letters, and a space bar. How long will he take to write this one little sentence?}}
The scenario is staged to produce a string of [[gibberish]] letters, assuming that the selection of each letter in a sequence of 28 characters will be random. The number of possible combinations in this random sequence is 27<sup>28</sup>, or about 10<sup>40</sup>, so the [[probability]] that the monkey will produce a given sequence is extremely low. Any particular sequence of 28 characters could be selected as a "target" phrase, all equally as improbable as Dawkins's chosen target, "METHINKS IT IS LIKE A WEASEL".
A [[computer program]] could be written to carry out the actions of Dawkins's [[Hypothesis|hypothetical]] monkey, continuously generating combinations of 26 letters and spaces at high speed. Even at the rate of millions of combinations per second, it is unlikely, even given the entire [[Age of the universe|lifetime of the universe]] to run, that the program would ever produce the phrase "METHINKS IT IS LIKE A WEASEL".<ref>For a string of 28 characters, with 27 possible characters (A-Z plus space), any randomly generated string has the probability of one in 27^28 of being correct; that is approximately one in 10^40. If a program generating 10 million strings per second had been running since the start of the universe (around 14 billion years, or 10^17 seconds), it would have only generated around 10^24 strings by now.</ref>
Dawkins intends this example to illustrate a common misunderstanding of [[evolution]]ary change, i.e. that [[DNA]] sequences or [[organic compound]]s such as [[proteins]] are the result of atoms randomly combining to form more complex structures. In these types of computations, any sequence of [[amino acids]] in a protein will be extraordinarily improbable (this is known as [[Hoyle's fallacy]]). Rather, evolution proceeds by [[hill climbing]], as in [[adaptive landscape]]s.
Dawkins then goes on to show that a process of ''cumulative'' selection can take far fewer steps to reach any given target. In Dawkins's words:
{{quote|We again use our computer monkey, but with a crucial difference in its program. It again begins by choosing a random sequence of 28 letters, just as before ... it duplicates it repeatedly, but with a certain chance of random [[error]] – 'mutation' – in the copying. The computer examines the [[mutant]] nonsense phrases, the 'progeny' of the original phrase, and chooses the one which,'' however slightly, ''most resembles the target phrase, METHINKS IT IS LIKE A WEASEL.}}
By repeating the procedure, a randomly generated sequence of 28 letters and spaces will be gradually changed each [[generation]]. The sequences progress through each generation:
:Generation 01:<tt> WDLTMNLT DTJBKWIRZREZLMQCO P</tt> <ref>Note: the 4th character of line 1 is missing in Dawkins' text; however line 2 suggests it was probably a T</ref>
:Generation 02:<tt> WDLTMNLT DTJBSWIRZREZLMQCO P</tt>
:Generation 10:<tt> MDLDMNLS ITJISWHRZREZ MECS P</tt>
:Generation 20:<tt> MELDINLS IT ISWPRKE Z WECSEL</tt>
:Generation 30:<tt> METHINGS IT ISWLIKE B WECSEL</tt>
:Generation 40:<tt> METHINKS IT IS LIKE I WEASEL</tt>
:Generation 43:<tt> METHINKS IT IS LIKE A WEASEL</tt>
Dawkins continues:
{{quote|The exact time taken by the computer to reach the target doesn't matter. If you want to know, it completed the whole exercise for me, the first time, while I was out to lunch. It took about half an hour. (Computer enthusiasts may think this unduly slow. The reason is that the program was written in [[BASIC programming language|BASIC]], a sort of computer baby-talk. When I rewrote it in [[Pascal programming language|Pascal]], it took 11 seconds.) Computers are a bit faster at this kind of thing than monkeys, but the difference really isn't significant. What matters is the difference between the time taken by'' cumulative ''selection, and the time which the same computer, working flat out at the same rate, would take to reach the target phrase if it were forced to use the other procedure of'' single-step selection: ''about a million million million million million years. This is more than a million million million times as long as the universe has so far existed.}}
== Algorithm ==
Richard Dawkins did not provide the source code for his program. We will use a standard genetic algorithm with no crossing over that could run as follows.
<code>
# Start with a random string of 28 characters.
# Make 100 copies of this string.
# Compare each new string with the target string "METHINKS IT IS LIKE A WEASEL", and give each a score (for each letter in the right place add 1 point).
# While no string has achieved the perfect score (28) do
## For each string:
### For each character on the string:
#### With a 5% chance per character, replace the character with a random character.
### Compare the string with "METHINKS IT IS LIKE A WEASEL", and score 1 point to each letter in the right place.
## Choose the better scored string and replace all the 100 copies with that string
</code>
The set character set are the set of uppercase letters and the blank space. Perhaps Dawkins may have used another strategy to create new generations. He may have used the technique of crossing-over, choosing the best scores and generating new strings from them by crossing-over. This will only alter the rate of convergence of the algorithm.
== Criticism ==
Dawkins's "weasel program" has been the subject of much debate. Intelligent Design proponent [[William Dembski]] states that choosing a prespecified target sequence as Dawkins does is deeply teleological.<ref>{{cite book|author=Dembski, William A|authorlink=William Dembski|title=No Free Lunch|subtitle=Why Specified Complexity Cannot Be Purchased without Intelligence|publisher=Rowman & Littlefield Publishers|pages=432|year=2007|isbn=978-074255810-6|location=Maryland}}</ref> Dembski has criticized its assumption that the intermittent stages of such a progression will be selected by evolutionary principles, and asserts that many genes that are useful in tandem would not have arisen independently.
===Pre-selected goal===
The first problem with the algorithm is that he has a pre-selected goal.<ref>{{cite book|author=Gitt, Werner|authorlink=Werner Gitt|title=In the Beginning was Information|subtitle=A Scientist Explains the the Incredible Design in Nature|year=2006|publisher=Master Books|location=Green Forest, AR|pages=260|page=102|url=|isbn=978-0-89051-461-0}}</ref> Royal Truman pointed out that "Once a letter falls into place, Dawkin's program ensures it won't mutate away".<ref>[http://creation.com/weasel-words-creation-magazine-critique-of-dawkins The weasel returns: Truman replies to Curtis]</ref> The examples of Dawkins in his book "The Blind Watchmaker" and in the magazine New Scientist seem to lead the reader to this conclusion. This is not the truth about the algorithm. And why? because this is a genetic algorithm that keeps the best phrases based upon an overall score of the sentence and eventually one letter in the right place can mutate in a phrase that many other letters go to the right place, so the overall score of the phrase is better. But the fact is that '''the algorithm was balanced in a way that the possibility of a phrase with a correct letter mutate into a wrong letter and the other letters stay equal is very small'''.
But in Darwin´s evolution, nature does not have any goal. When one fixes on a goal, he is in fact playing the role of God. The changes that supposedly lead to an evolution process are caused by random mutations, genetic drift and the process of natural or sexual selection. To fix a goal is to make the process of natural selection completely control the final form of the phrase created. In each of its features. This actually complicates the work of evolutionists because they have to find in each of the genes of all creatures a cause based on natural selection to explain the appearance of that trait.
===Intermediate forms===
Another flaw in the argument Dawkins made when using this algorithm, is that all intermediate forms of life are viable and reproduce as well as others. Timothy G. Standish, professor of biology at Andrews University in Berrien Springs, Michigan, pointed out that "Changing even one amino acid in a protein can alter its function dramatically".<ref>[http://www.answersingenesis.org/articles/isd/timothy-standish Timothy G. Standish, Biology]</ref> he continues saying:
{{quote|This idea of natural selection fixing amino acids as it constructs functional proteins is also unsupported by the data. Cells do not churn out large pools of random proteins on which natural selection can then act. If anything, precisely the opposite is true. Cells only produce the proteins they need to make at that time. Making other proteins, even unneeded functional ones, would be a wasteful thing for cells to do, and in many cases, could destroy the ability of the cell to function.}}
Now let's look at this issue from the completely opposite side. Consider that the only viable forms were:
* '''MWR SWTNUZMLDCLEUBXTQHNZVJQF''' (the first string) and
* '''METHINKS IT IS LIKE A WEASEL''' (the target string).
All other intermediate forms would be nonviable and would not leave offspring. In this extreme case (the extreme opposite to what was proposed by Dawkins) the chance of evolution (at a rate of change per character than 5%) would be: 0.05<sup>28</sup> or 3.725 x 10<sup>-37</sup>. An extremely low probability and the algorithm would run for a huge amount of years without achieving the result.
Of course, for the sake of justice, none of the two alternatives accurately depicts what happens in nature. But how to quantify the number of viable and nonviable intermediate forms? This is an important issue, as the more viable intermediate forms that exist, the greater the probability of intermediate forms to appear and the lower the run-time of the algorithm. Then, is using an extreme case to illustrate a possible phenomenon a scientific approach?
Another question that follows from this reasoning is a paradox: The greater the number of intermediate forms the lower the required number of mutations needed to achieve that intermediate form, therefore, the lower the time of the algorithm to advance one step. But a large number of intermediate forms does not fit very well with the fossil record. The lower the number of intermediate forms the greater the required number of mutations needed to achieve that intermediate form and therefore the greater the time for the algorithm to advance one step.
Les Ey and Don Batten have an approach very similar to that. They call it the "Error Catastrophe model".<ref>[http://creation.com/journal-of-creation-tj-162 Weasel, a flexible program for investigating deterministic computer ‘demonstrations’ of evolution
Research]</ref>
====Transitions between viable beings====
Another related issue is what happens when need to jump from one viable form to another viable form. Suppose that only one word in the sentence "me thinks it is like a weasel" would be changed, and the new phrase formed was grammatically correct. Through mutations, one would form invalid sentences of English along the way before he could finally get the sentence changed into a grammatically correct form.
{| class="wikitable"
!style="background:#AADFEA;"|Phrase
!style="background:#F0E68C;"|Gramatical status
!style="background:#AAEADF;"|Type of transformation as compared to the previous form
|-
|me thinks it is like a weasel
|grammatically correct<ref group=note>we are not considering the "me thinks" form</ref>
|none
|-
|me things it is like a weasel
|syntactically incorrect
|permutation
|-
|me thing it is like a weasel
|syntactically incorrect
|deletion
|-
|me shing it is like a weasel
|syntactically incorrect
|permutation
|-
|me sing it is like a weasel
|syntactically incorrect
|deletion
|-
|me ing it is like a weasel
|lexically and syntactically incorrect
|deletion
|-
|me ign it is like a weasel
|lexically and syntactically incorrect
|inversion (ng -> gn)
|-
|me igne it is like a weasel
|lexically and syntactically incorrect
|insertion
|-
|me iagne it is like a weasel
|lexically and syntactically incorrect
|insertion
|-
|me imagne it is like a weasel
|lexically and syntactically incorrect
|insertion
|-
|me imagine it is like a weasel
|grammatically correct
|insertion
|}
====Experiment====
[[File:Weasel.png|thumb|right|400px|EvoAlgo with the method changed showing 13 lines commented to set 13 letters not allowed]]
To illustrate the problem of the intermediate forms we developed an experiment based on the algorithm available in [http://rosettacode.org/wiki/Evolutionary_algorithm#Java EvoAlgo.java].<ref group=note>Content is available under GNU Free Documentation License 1.2.</ref> We choose the implementation in Java to perform the test. Every time we ran the program, for each position, we withdrew a letter as a possibility. [[Weasel java implementation|The program code segment changed is available here]]. For example, when running the program for the first time all combinations were allowed.
When running the program for the second time in the first position were not allowed the blank space. In the second position were not allowed the letter "A". In third position were not allowed the letter "B" and so on.
When running the program for the third time in the first position were not allowed the letters "Z " ("Z" and blank). In the second position were not allowed the letter " A" (blank and "A"). In third position were not allowed the letters "AB" ("A and "B") and so on.
when running the program for the seventh time in the first position were not allowed the letters "UVWXYZ ". In the second position were not allowed the letters "VWXYZ A". In third position were not allowed the letters "WXYZ AB" and so on until the 28th position.
It is important to note that, besides the letters permitted, two more are added (if they are not in the set): the letter corresponding to the position of the target sentence and the letter corresponding to the position of the current sentence. For instance, in the case of 10 letters excluded, the number of letters allowed can vary from 17-19 depending on whether the current letter of the given position and/or the target letter of the current position belongs to the set or not. So, in this case 8-10 letters will not enter in each position.
{{clear}}
The results are recorded in the table below <ref group=note>The parameters were not changed. number of spawn per generation=100, and minMutateRate = 0.09.</ref>:
{| class="wikitable"
!style="background:#EFBA99;"|Number of letters not allowed/location<ref group=note>
It is important to note that, besides the letters permitted, two more are added (if they are not in the set): the letter corresponding to the position of the target sentence and the letter corresponding to the position of the current sentence. For instance, in the case of 10 letters excluded, the number of letters allowed can vary from 17-19 depending on whether the current letter of the given position and/or the target letter of the current position belongs to the set or not. So, in this case 8-10 letters will not enter in each position.</ref>
!style="background:#AADFEA;"|Number of letters allowed/location
!style="background:#F0E68C;"|Number of generations to achieve the result (1st execution)
!style="background:#AAEADF;"|Number of generations to achieve the result (2nd execution)
|-
|style="background:#FFDAB9;"|0
|style="background:#BFEAEF;"|27
|style="background:#F7F6A8;"|569
|style="background:#BFEFEA;"|526
|-
|style="background:#EFBA99;"|0-1
|style="background:#AADFEA;"|26-27
|style="background:#F0E68C;"|668
|style="background:#AAEADF;"|805
|-
|style="background:#FFDAB9;"|0-2
|style="background:#BFEAEF;"|25-27
|style="background:#F7F6A8;"|1087
|style="background:#BFEFEA;"|920
|-
|style="background:#EFBA99;"|1-3
|style="background:#AADFEA;"|24-26
|style="background:#F0E68C;"|1253
|style="background:#AAEADF;"|1127
|-
|style="background:#FFDAB9;"|2-4
|style="background:#BFEAEF;"|23-25
|style="background:#F7F6A8;"|1552
|style="background:#BFEFEA;"|2481
|-
|style="background:#EFBA99;"|3-5
|style="background:#AADFEA;"|22-24
|style="background:#F0E68C;"|2290
|style="background:#AAEADF;"|1821
|-
|style="background:#FFDAB9;"|4-6
|style="background:#BFEAEF;"|21-23
|style="background:#F7F6A8;"|1873
|style="background:#BFEFEA;"|3282
|-
|style="background:#EFBA99;"|5-7
|style="background:#AADFEA;"|20-22
|style="background:#F0E68C;"|3078
|style="background:#AAEADF;"|4394
|-
|style="background:#FFDAB9;"|6-8
|style="background:#BFEAEF;"|19-21
|style="background:#F7F6A8;"|6526
|style="background:#BFEFEA;"|8188
|-
|style="background:#EFBA99;"|7-9
|style="background:#AADFEA;"|18-20
|style="background:#F0E68C;"|10561
|style="background:#AAEADF;"|9306
|-
|style="background:#FFDAB9;"|8-10
|style="background:#BFEAEF;"|17-19
|style="background:#F7F6A8;"|29837
|style="background:#BFEFEA;"|16770
|-
|style="background:#EFBA99;"|9-11
|style="background:#AADFEA;"|16-18
|style="background:#F0E68C;"|70037
|style="background:#AAEADF;"|30220
|-
|style="background:#FFDAB9;"|10-12
|style="background:#BFEAEF;"|15-17
|style="background:#F7F6A8;"|78704
|style="background:#BFEFEA;"|63363
|-
|style="background:#EFBA99;"|11-13
|style="background:#AADFEA;"|14-16
|style="background:#F0E68C;"|427193
|style="background:#AAEADF;"|143010
|-
|style="background:#FFDAB9;"|12-14
|style="background:#BFEAEF;"|13-15
|style="background:#F7F6A8;"|726978
|style="background:#BFEFEA;"|341149
|-
|style="background:#EFBA99;"|13-15
|style="background:#AADFEA;"|12-14
|style="background:#F0E68C;"|1587174
|style="background:#AAEADF;"|1150129
|-
|style="background:#FFDAB9;"|14-16
|style="background:#BFEAEF;"|11-13
|style="background:#F7F6A8;"|4815120
|style="background:#BFEFEA;"|4010293
|-
|style="background:#EFBA99;"|15-17
|style="background:#AADFEA;"|10-12
|style="background:#F0E68C;"|47212423
|style="background:#AAEADF;"|63659913
|}
It is very easy to see that as we increase the not feasible combinations, the number of generations and time to process required increases exponentially. For instance, with thirteen letters allowed per location the number of valid sentences is 13<sup>28</sup> (~1.55 x 10<sup>31</sup>) in a universe of 27<sup>28</sup> (~1.19 x 10<sup>40</sup>) possible sentences.
[[File:Weasel2.png|thumb|left|700px|EvoAlgo with the method changed showing 17 lines commented to set 15-17 letters not allowed]]
The last execution of the program (with 17 letters not allowed) resulted in 63,659,913 generations to achieve the desired result. The running time of the algorithm was ~14 hours. With even fewer letters allowed the execution would take much more time (exponential growing).
{{clear}}
===Fixed length===
Another flaw in the Dawkins´s algorithm is keeping the number of a characters fixed in each step. This is unlike what occurs in nature, nor even with what would be expected of monkeys typing on a typewriter. Why would the monkeys hit the exactly number of letters (28) in his attempt? In the case in nature, chromosomes experience insertions, deletions and inversions. This can result in copies of greater length or shorter. For instance:
'''ME THANKS YOU VERY MUCH IT ISNT LIKE IN NATURE''' or<br />
'''NOT CONVINCED ME, THANKS'''
===The smallest living being===
Bacteria with a smaller number of genes has approximately 500 genes. Even for the smallest living thing, some functions must exist before it can reproduce: obtain food or materials, synthesize genetic material and procure energy. Karp lists some common functions to cells<ref name=karp>{{cite book|author=Karp, Gerald|title=Cell and Molecular Biology:Concepts and Experiments|year=2008|location=New Jersey|publisher=John Wiley|edition=5th|page=5-6|isbn=978-0-470-04217-5}}</ref>:
* Cells possess a genetic program and means to use it.
* Cells are capable of producing more of themselves.
* Cells acquire and utilize energy.
* Cells Carry out a Variety of Chemical reactions.
* Cells engage in mechanical activities.
* Cells are capable of self-regulation.
This requires a minimum number of genes. Some scientists stated in recent theoretical and experimental work on the so-called “minimal complexity” required to sustain the simplest possible living organism suggests a lower bound of some 250-400 genes and their corresponding proteins.<ref>{{cite journal |last=Meyer|first=Stephen C |author= |authorlink=Stephen C. Meyer |coauthors= |editor1-first=John Angus |editor1-last=Campbell |editor1-link= |editor2-first=Stephen C. |editor2-last=Meyer|date= |year=2003|month= |title=DNA and the Origin of Life: Information, Specification, and Explanation |trans_title= |journal=Darwinism, Design, & Public Education |volume= |series= |issue= |pages=223-285 |at= |publisher=Michigan State University Press |location=Lansing, Michigan |issn= |pmid= |pmc= |doi=|bibcode= |oclc= |id= |url=http://www.discovery.org/articleFiles/PDFs/DNAPerspectives.pdf |language= |format= |accessdate= |laysummary= |laysource= |laydate= |quote= |ref= |postscript= }}</ref><ref>{{cite journal |last=Mushegian|first=Arcady R |author=|authorlink=|coauthors=Koonin, Eugene V. |editor1-first= |editor1-last= |editor1-link= |editor2-first= |editor2-last=|date=1996-09-17 |year=1996|month=September |title=A minimal gene set for cellular life derived by comparison of complete bacterial genomes |trans_title= |journal=Proc. Natl. Acad. Sci. USA|volume=93 |series= |issue=19 |pages=10268-10273|at= |publisher= |location= |issn= |pmid= |pmc=|doi= |bibcode= |oclc= |id= |url=http://www.pnas.org/content/93/19/10268.full.pdf|language= |format= |accessdate= |laysummary= |laysource= |laydate= |quote= |ref= |postscript= }}</ref> To jump from inanimate matter to the simplest form of life there are no intermediate steps. Thus, for the simplest living being, the Dawkins algorithm does not even apply. And in this particular case the [[infinite monkey theorem]] does apply.
===Parallel with DNA===
Although Dawkins has not done this parallel in his example, when one consider the DNA in place of letters of the alphabet, more problems arise. Here we will use an example based on the example exposed in the book of I. L. Cohen.<ref>{{cite book|author=Cohen, I. L|authorlink=|title=Darwin was Wrong - A Study in Probabilities|publisher=New Research Publications, Inc.|pages=225|page=74-76|year=1984|isbn=0-910891-02-8|location=Greenvale, New York}}</ref> There are 20 amino acids (there are more than 20, but for the sake of simplicity lets consider the common ones) that are read through the RNA genetic code. We can represent these amino acids by a letter of the alphabet. Each of these amino acids is formed from a set of three nucleotides called codons or triplets. Suppose we have an RNA sequence that reads:
'''AUG UCU UAC AAG GCC GUG UAA'''
This message translates to:
AUG - start reading,
UCU - attract amino acid Serine,
UAC - attach amino acid Tyrosine,
AAG - attach amino acid Lysine,
GCC - attach amino acid Alanine,
GUG - attach amino acid Valine,
UAA - stop production.
Assuming now that the fifth nucleotide code (Cytosine) is destroyed. Now the message will translate very differently from before even though only one nucleotide have changed from one RNA to another:
'''AUG UUU ACA AGG CCG UGU AA_'''
This message translates now to:
AUG - start reading,
UUU - attract amino acid Leucine,
ACA - attach amino acid Threonine,
AGG - attach amino acid Arginine,
CCG - attach amino acid Proline,
UGU - attach amino acid Cysteine,
AA_ - it depends upon the next nucleotide.
Back to the example of Hamlet's phrase, the change in a letter, (for instance, the letter 'A' of the word 'AT' ) (assuming that each letter was composed of three nucleotides) could mean changing the whole sentence. For instance:
'''ME THINKS AT IS LIKE A UEASEL''' would change, for instance, to:
'''ME THINKS ZUAJTAMJLFABAWFBTFMA'''
This example shows how easy it is to ruin a code with a simple change.
==See also==
* [[The outcome of Dawkins' WEASEL program was prespecified (Talk.Origins)]]
* [[Evolution program]]
== Notes ==
<references group="note"/>
== References ==
{{reflist}}
== External links ==
* [http://creation.com/weasel-words-creation-magazine-critique-of-dawkins The weasel returns: Truman replies to Curtis] The weasel returns: Truman replies to Curtis.
* [http://rosettacode.org/wiki/Evolutionary_algorithm Implementation of Weasel programs in many programming languages] Implementation of Weasel programs in many programming languages.
* [http://www.detectingdesign.com/methinksitislikeaweasel.html Methinks it is Like a Weasel by D. Pitman M.D.] Methinks it is Like a Weasel by D. Pitman M.D.
* [http://www.answersingenesis.org/articles/tj/v12/n3/dawkins Dawkins’ Weasel Revisited] Dawkins’ Weasel Revisited.
* [http://www.answersingenesis.org/articles/isd/timothy-standish Timothy G. Standish, Biology] Timothy G. Standish, Biology
* {{cite book|author=Gitt, Werner|title=In the Beginning was Information|subtitle=A Scientist Explains the the Incredible Design in Nature|year=2006|publisher=Master Books|location=Green Forest, AR|pages=260|url=|isbn=978-0-89051-461-0}} [http://books.google.com.br/books?id=ajeomfd1-B8C&lpg=PA101&ots=2-8J87wp8j&dq=METHINKS%20IT%20IS%20LIKE%20A%20WEASEL%20Werner%20Gitt&hl=pt-BR&pg=PA102#v=onepage&q&f=false Link to the book on google books]
* [http://creation.com/weasel-a-flexible-program-for-invest-deterministic-computer-demonstrations-of-evolution Weasel, a flexible program for investigating deterministic computer ‘demonstrations’ of evolution]
[[Category:Richard Dawkins]]
-->
[[en:Weasel program]]
[[pt:Programa weasel]]
El '''weasel program''' o '''weasel de Dawkins''', es un experimento de pensamiento y una variedad de simulaciones por ordenador que ilustran esto.
<!--
The thought experiment was formulated by [[Richard Dawkins]], and the first simulation was written by him; various other implementations of the program have been written by others. Dawkins made a disclaimer noting that this experiment was not intended to show how real evolution works, but to attempt to show the improvement gained by a selection mechanism in an evolutionary process. Dawkins acknowledged that to some extent his model is "misleading in important ways".<ref>{{cite book|author=Spetner, Lee M|authorlink=Lee Spetner|title=Not by Chance!|subtitle=Shattering the Modern Theory of Evolution|publisher=Judaica Press|pages=272|page=168|year=1997|isbn=978-1-88058224-4|location=Brooklin, New York}}</ref>
== Overview<ref>The authors of this section are the authors of the Wikipedia article as in [http://en.wikipedia.org/wiki/Weasel_program Weasel program]</ref> ==
In chapter 3 of his book ''[[The Blind Watchmaker]]'', Dawkins gave the following introduction to the program, referencing the well-known [[infinite monkey theorem]]:
{{quote|I don't know who it was first pointed out that, given enough time, a monkey bashing away at [[Randomness|random]] on a typewriter could produce all the works of Shakespeare. The operative phrase is, of course, given enough time. Let us limit the task facing our monkey somewhat. Suppose that he has to produce, not the complete works of Shakespeare but just the short sentence 'Methinks it is like a weasel', and we shall make it relatively easy by giving him a typewriter with a restricted keyboard, one with just the 26 (capital) letters, and a space bar. How long will he take to write this one little sentence?}}
The scenario is staged to produce a string of [[gibberish]] letters, assuming that the selection of each letter in a sequence of 28 characters will be random. The number of possible combinations in this random sequence is 27<sup>28</sup>, or about 10<sup>40</sup>, so the [[probability]] that the monkey will produce a given sequence is extremely low. Any particular sequence of 28 characters could be selected as a "target" phrase, all equally as improbable as Dawkins's chosen target, "METHINKS IT IS LIKE A WEASEL".
A [[computer program]] could be written to carry out the actions of Dawkins's [[Hypothesis|hypothetical]] monkey, continuously generating combinations of 26 letters and spaces at high speed. Even at the rate of millions of combinations per second, it is unlikely, even given the entire [[Age of the universe|lifetime of the universe]] to run, that the program would ever produce the phrase "METHINKS IT IS LIKE A WEASEL".<ref>For a string of 28 characters, with 27 possible characters (A-Z plus space), any randomly generated string has the probability of one in 27^28 of being correct; that is approximately one in 10^40. If a program generating 10 million strings per second had been running since the start of the universe (around 14 billion years, or 10^17 seconds), it would have only generated around 10^24 strings by now.</ref>
Dawkins intends this example to illustrate a common misunderstanding of [[evolution]]ary change, i.e. that [[DNA]] sequences or [[organic compound]]s such as [[proteins]] are the result of atoms randomly combining to form more complex structures. In these types of computations, any sequence of [[amino acids]] in a protein will be extraordinarily improbable (this is known as [[Hoyle's fallacy]]). Rather, evolution proceeds by [[hill climbing]], as in [[adaptive landscape]]s.
Dawkins then goes on to show that a process of ''cumulative'' selection can take far fewer steps to reach any given target. In Dawkins's words:
{{quote|We again use our computer monkey, but with a crucial difference in its program. It again begins by choosing a random sequence of 28 letters, just as before ... it duplicates it repeatedly, but with a certain chance of random [[error]] – 'mutation' – in the copying. The computer examines the [[mutant]] nonsense phrases, the 'progeny' of the original phrase, and chooses the one which,'' however slightly, ''most resembles the target phrase, METHINKS IT IS LIKE A WEASEL.}}
By repeating the procedure, a randomly generated sequence of 28 letters and spaces will be gradually changed each [[generation]]. The sequences progress through each generation:
:Generation 01:<tt> WDLTMNLT DTJBKWIRZREZLMQCO P</tt> <ref>Note: the 4th character of line 1 is missing in Dawkins' text; however line 2 suggests it was probably a T</ref>
:Generation 02:<tt> WDLTMNLT DTJBSWIRZREZLMQCO P</tt>
:Generation 10:<tt> MDLDMNLS ITJISWHRZREZ MECS P</tt>
:Generation 20:<tt> MELDINLS IT ISWPRKE Z WECSEL</tt>
:Generation 30:<tt> METHINGS IT ISWLIKE B WECSEL</tt>
:Generation 40:<tt> METHINKS IT IS LIKE I WEASEL</tt>
:Generation 43:<tt> METHINKS IT IS LIKE A WEASEL</tt>
Dawkins continues:
{{quote|The exact time taken by the computer to reach the target doesn't matter. If you want to know, it completed the whole exercise for me, the first time, while I was out to lunch. It took about half an hour. (Computer enthusiasts may think this unduly slow. The reason is that the program was written in [[BASIC programming language|BASIC]], a sort of computer baby-talk. When I rewrote it in [[Pascal programming language|Pascal]], it took 11 seconds.) Computers are a bit faster at this kind of thing than monkeys, but the difference really isn't significant. What matters is the difference between the time taken by'' cumulative ''selection, and the time which the same computer, working flat out at the same rate, would take to reach the target phrase if it were forced to use the other procedure of'' single-step selection: ''about a million million million million million years. This is more than a million million million times as long as the universe has so far existed.}}
== Algorithm ==
Richard Dawkins did not provide the source code for his program. We will use a standard genetic algorithm with no crossing over that could run as follows.
<code>
# Start with a random string of 28 characters.
# Make 100 copies of this string.
# Compare each new string with the target string "METHINKS IT IS LIKE A WEASEL", and give each a score (for each letter in the right place add 1 point).
# While no string has achieved the perfect score (28) do
## For each string:
### For each character on the string:
#### With a 5% chance per character, replace the character with a random character.
### Compare the string with "METHINKS IT IS LIKE A WEASEL", and score 1 point to each letter in the right place.
## Choose the better scored string and replace all the 100 copies with that string
</code>
The set character set are the set of uppercase letters and the blank space. Perhaps Dawkins may have used another strategy to create new generations. He may have used the technique of crossing-over, choosing the best scores and generating new strings from them by crossing-over. This will only alter the rate of convergence of the algorithm.
== Criticism ==
Dawkins's "weasel program" has been the subject of much debate. Intelligent Design proponent [[William Dembski]] states that choosing a prespecified target sequence as Dawkins does is deeply teleological.<ref>{{cite book|author=Dembski, William A|authorlink=William Dembski|title=No Free Lunch|subtitle=Why Specified Complexity Cannot Be Purchased without Intelligence|publisher=Rowman & Littlefield Publishers|pages=432|year=2007|isbn=978-074255810-6|location=Maryland}}</ref> Dembski has criticized its assumption that the intermittent stages of such a progression will be selected by evolutionary principles, and asserts that many genes that are useful in tandem would not have arisen independently.
===Pre-selected goal===
The first problem with the algorithm is that he has a pre-selected goal.<ref>{{cite book|author=Gitt, Werner|authorlink=Werner Gitt|title=In the Beginning was Information|subtitle=A Scientist Explains the the Incredible Design in Nature|year=2006|publisher=Master Books|location=Green Forest, AR|pages=260|page=102|url=|isbn=978-0-89051-461-0}}</ref> Royal Truman pointed out that "Once a letter falls into place, Dawkin's program ensures it won't mutate away".<ref>[http://creation.com/weasel-words-creation-magazine-critique-of-dawkins The weasel returns: Truman replies to Curtis]</ref> The examples of Dawkins in his book "The Blind Watchmaker" and in the magazine New Scientist seem to lead the reader to this conclusion. This is not the truth about the algorithm. And why? because this is a genetic algorithm that keeps the best phrases based upon an overall score of the sentence and eventually one letter in the right place can mutate in a phrase that many other letters go to the right place, so the overall score of the phrase is better. But the fact is that '''the algorithm was balanced in a way that the possibility of a phrase with a correct letter mutate into a wrong letter and the other letters stay equal is very small'''.
But in Darwin´s evolution, nature does not have any goal. When one fixes on a goal, he is in fact playing the role of God. The changes that supposedly lead to an evolution process are caused by random mutations, genetic drift and the process of natural or sexual selection. To fix a goal is to make the process of natural selection completely control the final form of the phrase created. In each of its features. This actually complicates the work of evolutionists because they have to find in each of the genes of all creatures a cause based on natural selection to explain the appearance of that trait.
===Intermediate forms===
Another flaw in the argument Dawkins made when using this algorithm, is that all intermediate forms of life are viable and reproduce as well as others. Timothy G. Standish, professor of biology at Andrews University in Berrien Springs, Michigan, pointed out that "Changing even one amino acid in a protein can alter its function dramatically".<ref>[http://www.answersingenesis.org/articles/isd/timothy-standish Timothy G. Standish, Biology]</ref> he continues saying:
{{quote|This idea of natural selection fixing amino acids as it constructs functional proteins is also unsupported by the data. Cells do not churn out large pools of random proteins on which natural selection can then act. If anything, precisely the opposite is true. Cells only produce the proteins they need to make at that time. Making other proteins, even unneeded functional ones, would be a wasteful thing for cells to do, and in many cases, could destroy the ability of the cell to function.}}
Now let's look at this issue from the completely opposite side. Consider that the only viable forms were:
* '''MWR SWTNUZMLDCLEUBXTQHNZVJQF''' (the first string) and
* '''METHINKS IT IS LIKE A WEASEL''' (the target string).
All other intermediate forms would be nonviable and would not leave offspring. In this extreme case (the extreme opposite to what was proposed by Dawkins) the chance of evolution (at a rate of change per character than 5%) would be: 0.05<sup>28</sup> or 3.725 x 10<sup>-37</sup>. An extremely low probability and the algorithm would run for a huge amount of years without achieving the result.
Of course, for the sake of justice, none of the two alternatives accurately depicts what happens in nature. But how to quantify the number of viable and nonviable intermediate forms? This is an important issue, as the more viable intermediate forms that exist, the greater the probability of intermediate forms to appear and the lower the run-time of the algorithm. Then, is using an extreme case to illustrate a possible phenomenon a scientific approach?
Another question that follows from this reasoning is a paradox: The greater the number of intermediate forms the lower the required number of mutations needed to achieve that intermediate form, therefore, the lower the time of the algorithm to advance one step. But a large number of intermediate forms does not fit very well with the fossil record. The lower the number of intermediate forms the greater the required number of mutations needed to achieve that intermediate form and therefore the greater the time for the algorithm to advance one step.
Les Ey and Don Batten have an approach very similar to that. They call it the "Error Catastrophe model".<ref>[http://creation.com/journal-of-creation-tj-162 Weasel, a flexible program for investigating deterministic computer ‘demonstrations’ of evolution
Research]</ref>
====Transitions between viable beings====
Another related issue is what happens when need to jump from one viable form to another viable form. Suppose that only one word in the sentence "me thinks it is like a weasel" would be changed, and the new phrase formed was grammatically correct. Through mutations, one would form invalid sentences of English along the way before he could finally get the sentence changed into a grammatically correct form.
{| class="wikitable"
!style="background:#AADFEA;"|Phrase
!style="background:#F0E68C;"|Gramatical status
!style="background:#AAEADF;"|Type of transformation as compared to the previous form
|-
|me thinks it is like a weasel
|grammatically correct<ref group=note>we are not considering the "me thinks" form</ref>
|none
|-
|me things it is like a weasel
|syntactically incorrect
|permutation
|-
|me thing it is like a weasel
|syntactically incorrect
|deletion
|-
|me shing it is like a weasel
|syntactically incorrect
|permutation
|-
|me sing it is like a weasel
|syntactically incorrect
|deletion
|-
|me ing it is like a weasel
|lexically and syntactically incorrect
|deletion
|-
|me ign it is like a weasel
|lexically and syntactically incorrect
|inversion (ng -> gn)
|-
|me igne it is like a weasel
|lexically and syntactically incorrect
|insertion
|-
|me iagne it is like a weasel
|lexically and syntactically incorrect
|insertion
|-
|me imagne it is like a weasel
|lexically and syntactically incorrect
|insertion
|-
|me imagine it is like a weasel
|grammatically correct
|insertion
|}
====Experiment====
[[File:Weasel.png|thumb|right|400px|EvoAlgo with the method changed showing 13 lines commented to set 13 letters not allowed]]
To illustrate the problem of the intermediate forms we developed an experiment based on the algorithm available in [http://rosettacode.org/wiki/Evolutionary_algorithm#Java EvoAlgo.java].<ref group=note>Content is available under GNU Free Documentation License 1.2.</ref> We choose the implementation in Java to perform the test. Every time we ran the program, for each position, we withdrew a letter as a possibility. [[Weasel java implementation|The program code segment changed is available here]]. For example, when running the program for the first time all combinations were allowed.
When running the program for the second time in the first position were not allowed the blank space. In the second position were not allowed the letter "A". In third position were not allowed the letter "B" and so on.
When running the program for the third time in the first position were not allowed the letters "Z " ("Z" and blank). In the second position were not allowed the letter " A" (blank and "A"). In third position were not allowed the letters "AB" ("A and "B") and so on.
when running the program for the seventh time in the first position were not allowed the letters "UVWXYZ ". In the second position were not allowed the letters "VWXYZ A". In third position were not allowed the letters "WXYZ AB" and so on until the 28th position.
It is important to note that, besides the letters permitted, two more are added (if they are not in the set): the letter corresponding to the position of the target sentence and the letter corresponding to the position of the current sentence. For instance, in the case of 10 letters excluded, the number of letters allowed can vary from 17-19 depending on whether the current letter of the given position and/or the target letter of the current position belongs to the set or not. So, in this case 8-10 letters will not enter in each position.
{{clear}}
The results are recorded in the table below <ref group=note>The parameters were not changed. number of spawn per generation=100, and minMutateRate = 0.09.</ref>:
{| class="wikitable"
!style="background:#EFBA99;"|Number of letters not allowed/location<ref group=note>
It is important to note that, besides the letters permitted, two more are added (if they are not in the set): the letter corresponding to the position of the target sentence and the letter corresponding to the position of the current sentence. For instance, in the case of 10 letters excluded, the number of letters allowed can vary from 17-19 depending on whether the current letter of the given position and/or the target letter of the current position belongs to the set or not. So, in this case 8-10 letters will not enter in each position.</ref>
!style="background:#AADFEA;"|Number of letters allowed/location
!style="background:#F0E68C;"|Number of generations to achieve the result (1st execution)
!style="background:#AAEADF;"|Number of generations to achieve the result (2nd execution)
|-
|style="background:#FFDAB9;"|0
|style="background:#BFEAEF;"|27
|style="background:#F7F6A8;"|569
|style="background:#BFEFEA;"|526
|-
|style="background:#EFBA99;"|0-1
|style="background:#AADFEA;"|26-27
|style="background:#F0E68C;"|668
|style="background:#AAEADF;"|805
|-
|style="background:#FFDAB9;"|0-2
|style="background:#BFEAEF;"|25-27
|style="background:#F7F6A8;"|1087
|style="background:#BFEFEA;"|920
|-
|style="background:#EFBA99;"|1-3
|style="background:#AADFEA;"|24-26
|style="background:#F0E68C;"|1253
|style="background:#AAEADF;"|1127
|-
|style="background:#FFDAB9;"|2-4
|style="background:#BFEAEF;"|23-25
|style="background:#F7F6A8;"|1552
|style="background:#BFEFEA;"|2481
|-
|style="background:#EFBA99;"|3-5
|style="background:#AADFEA;"|22-24
|style="background:#F0E68C;"|2290
|style="background:#AAEADF;"|1821
|-
|style="background:#FFDAB9;"|4-6
|style="background:#BFEAEF;"|21-23
|style="background:#F7F6A8;"|1873
|style="background:#BFEFEA;"|3282
|-
|style="background:#EFBA99;"|5-7
|style="background:#AADFEA;"|20-22
|style="background:#F0E68C;"|3078
|style="background:#AAEADF;"|4394
|-
|style="background:#FFDAB9;"|6-8
|style="background:#BFEAEF;"|19-21
|style="background:#F7F6A8;"|6526
|style="background:#BFEFEA;"|8188
|-
|style="background:#EFBA99;"|7-9
|style="background:#AADFEA;"|18-20
|style="background:#F0E68C;"|10561
|style="background:#AAEADF;"|9306
|-
|style="background:#FFDAB9;"|8-10
|style="background:#BFEAEF;"|17-19
|style="background:#F7F6A8;"|29837
|style="background:#BFEFEA;"|16770
|-
|style="background:#EFBA99;"|9-11
|style="background:#AADFEA;"|16-18
|style="background:#F0E68C;"|70037
|style="background:#AAEADF;"|30220
|-
|style="background:#FFDAB9;"|10-12
|style="background:#BFEAEF;"|15-17
|style="background:#F7F6A8;"|78704
|style="background:#BFEFEA;"|63363
|-
|style="background:#EFBA99;"|11-13
|style="background:#AADFEA;"|14-16
|style="background:#F0E68C;"|427193
|style="background:#AAEADF;"|143010
|-
|style="background:#FFDAB9;"|12-14
|style="background:#BFEAEF;"|13-15
|style="background:#F7F6A8;"|726978
|style="background:#BFEFEA;"|341149
|-
|style="background:#EFBA99;"|13-15
|style="background:#AADFEA;"|12-14
|style="background:#F0E68C;"|1587174
|style="background:#AAEADF;"|1150129
|-
|style="background:#FFDAB9;"|14-16
|style="background:#BFEAEF;"|11-13
|style="background:#F7F6A8;"|4815120
|style="background:#BFEFEA;"|4010293
|-
|style="background:#EFBA99;"|15-17
|style="background:#AADFEA;"|10-12
|style="background:#F0E68C;"|47212423
|style="background:#AAEADF;"|63659913
|}
It is very easy to see that as we increase the not feasible combinations, the number of generations and time to process required increases exponentially. For instance, with thirteen letters allowed per location the number of valid sentences is 13<sup>28</sup> (~1.55 x 10<sup>31</sup>) in a universe of 27<sup>28</sup> (~1.19 x 10<sup>40</sup>) possible sentences.
[[File:Weasel2.png|thumb|left|700px|EvoAlgo with the method changed showing 17 lines commented to set 15-17 letters not allowed]]
The last execution of the program (with 17 letters not allowed) resulted in 63,659,913 generations to achieve the desired result. The running time of the algorithm was ~14 hours. With even fewer letters allowed the execution would take much more time (exponential growing).
{{clear}}
===Fixed length===
Another flaw in the Dawkins´s algorithm is keeping the number of a characters fixed in each step. This is unlike what occurs in nature, nor even with what would be expected of monkeys typing on a typewriter. Why would the monkeys hit the exactly number of letters (28) in his attempt? In the case in nature, chromosomes experience insertions, deletions and inversions. This can result in copies of greater length or shorter. For instance:
'''ME THANKS YOU VERY MUCH IT ISNT LIKE IN NATURE''' or<br />
'''NOT CONVINCED ME, THANKS'''
===The smallest living being===
Bacteria with a smaller number of genes has approximately 500 genes. Even for the smallest living thing, some functions must exist before it can reproduce: obtain food or materials, synthesize genetic material and procure energy. Karp lists some common functions to cells<ref name=karp>{{cite book|author=Karp, Gerald|title=Cell and Molecular Biology:Concepts and Experiments|year=2008|location=New Jersey|publisher=John Wiley|edition=5th|page=5-6|isbn=978-0-470-04217-5}}</ref>:
* Cells possess a genetic program and means to use it.
* Cells are capable of producing more of themselves.
* Cells acquire and utilize energy.
* Cells Carry out a Variety of Chemical reactions.
* Cells engage in mechanical activities.
* Cells are capable of self-regulation.
This requires a minimum number of genes. Some scientists stated in recent theoretical and experimental work on the so-called “minimal complexity” required to sustain the simplest possible living organism suggests a lower bound of some 250-400 genes and their corresponding proteins.<ref>{{cite journal |last=Meyer|first=Stephen C |author= |authorlink=Stephen C. Meyer |coauthors= |editor1-first=John Angus |editor1-last=Campbell |editor1-link= |editor2-first=Stephen C. |editor2-last=Meyer|date= |year=2003|month= |title=DNA and the Origin of Life: Information, Specification, and Explanation |trans_title= |journal=Darwinism, Design, & Public Education |volume= |series= |issue= |pages=223-285 |at= |publisher=Michigan State University Press |location=Lansing, Michigan |issn= |pmid= |pmc= |doi=|bibcode= |oclc= |id= |url=http://www.discovery.org/articleFiles/PDFs/DNAPerspectives.pdf |language= |format= |accessdate= |laysummary= |laysource= |laydate= |quote= |ref= |postscript= }}</ref><ref>{{cite journal |last=Mushegian|first=Arcady R |author=|authorlink=|coauthors=Koonin, Eugene V. |editor1-first= |editor1-last= |editor1-link= |editor2-first= |editor2-last=|date=1996-09-17 |year=1996|month=September |title=A minimal gene set for cellular life derived by comparison of complete bacterial genomes |trans_title= |journal=Proc. Natl. Acad. Sci. USA|volume=93 |series= |issue=19 |pages=10268-10273|at= |publisher= |location= |issn= |pmid= |pmc=|doi= |bibcode= |oclc= |id= |url=http://www.pnas.org/content/93/19/10268.full.pdf|language= |format= |accessdate= |laysummary= |laysource= |laydate= |quote= |ref= |postscript= }}</ref> To jump from inanimate matter to the simplest form of life there are no intermediate steps. Thus, for the simplest living being, the Dawkins algorithm does not even apply. And in this particular case the [[infinite monkey theorem]] does apply.
===Parallel with DNA===
Although Dawkins has not done this parallel in his example, when one consider the DNA in place of letters of the alphabet, more problems arise. Here we will use an example based on the example exposed in the book of I. L. Cohen.<ref>{{cite book|author=Cohen, I. L|authorlink=|title=Darwin was Wrong - A Study in Probabilities|publisher=New Research Publications, Inc.|pages=225|page=74-76|year=1984|isbn=0-910891-02-8|location=Greenvale, New York}}</ref> There are 20 amino acids (there are more than 20, but for the sake of simplicity lets consider the common ones) that are read through the RNA genetic code. We can represent these amino acids by a letter of the alphabet. Each of these amino acids is formed from a set of three nucleotides called codons or triplets. Suppose we have an RNA sequence that reads:
'''AUG UCU UAC AAG GCC GUG UAA'''
This message translates to:
AUG - start reading,
UCU - attract amino acid Serine,
UAC - attach amino acid Tyrosine,
AAG - attach amino acid Lysine,
GCC - attach amino acid Alanine,
GUG - attach amino acid Valine,
UAA - stop production.
Assuming now that the fifth nucleotide code (Cytosine) is destroyed. Now the message will translate very differently from before even though only one nucleotide have changed from one RNA to another:
'''AUG UUU ACA AGG CCG UGU AA_'''
This message translates now to:
AUG - start reading,
UUU - attract amino acid Leucine,
ACA - attach amino acid Threonine,
AGG - attach amino acid Arginine,
CCG - attach amino acid Proline,
UGU - attach amino acid Cysteine,
AA_ - it depends upon the next nucleotide.
Back to the example of Hamlet's phrase, the change in a letter, (for instance, the letter 'A' of the word 'AT' ) (assuming that each letter was composed of three nucleotides) could mean changing the whole sentence. For instance:
'''ME THINKS AT IS LIKE A UEASEL''' would change, for instance, to:
'''ME THINKS ZUAJTAMJLFABAWFBTFMA'''
This example shows how easy it is to ruin a code with a simple change.
==See also==
* [[The outcome of Dawkins' WEASEL program was prespecified (Talk.Origins)]]
* [[Evolution program]]
== Notes ==
<references group="note"/>
== References ==
{{reflist}}
== External links ==
* [http://creation.com/weasel-words-creation-magazine-critique-of-dawkins The weasel returns: Truman replies to Curtis] The weasel returns: Truman replies to Curtis.
* [http://rosettacode.org/wiki/Evolutionary_algorithm Implementation of Weasel programs in many programming languages] Implementation of Weasel programs in many programming languages.
* [http://www.detectingdesign.com/methinksitislikeaweasel.html Methinks it is Like a Weasel by D. Pitman M.D.] Methinks it is Like a Weasel by D. Pitman M.D.
* [http://www.answersingenesis.org/articles/tj/v12/n3/dawkins Dawkins’ Weasel Revisited] Dawkins’ Weasel Revisited.
* [http://www.answersingenesis.org/articles/isd/timothy-standish Timothy G. Standish, Biology] Timothy G. Standish, Biology
* {{cite book|author=Gitt, Werner|title=In the Beginning was Information|subtitle=A Scientist Explains the the Incredible Design in Nature|year=2006|publisher=Master Books|location=Green Forest, AR|pages=260|url=|isbn=978-0-89051-461-0}} [http://books.google.com.br/books?id=ajeomfd1-B8C&lpg=PA101&ots=2-8J87wp8j&dq=METHINKS%20IT%20IS%20LIKE%20A%20WEASEL%20Werner%20Gitt&hl=pt-BR&pg=PA102#v=onepage&q&f=false Link to the book on google books]
* [http://creation.com/weasel-a-flexible-program-for-invest-deterministic-computer-demonstrations-of-evolution Weasel, a flexible program for investigating deterministic computer ‘demonstrations’ of evolution]
[[Category:Richard Dawkins]]
-->
[[en:Weasel program]]
[[pt:Programa weasel]]
