Popa Andrei, McDowell J J
Emory University, Psychology, 36 Eagle Row, Suite 270 Emory University, Atlanta, GA 30322, United States.
Behav Processes. 2010 May;84(1):428-34. doi: 10.1016/j.beproc.2010.02.002. Epub 2010 Feb 10.
McDowell (2004) instantiated the Darwinian principles of selection, recombination, and mutation in a computational model of selection by consequences. The model has been tested under a variety of conditions and the outcome is quantitatively indistinguishable from that displayed by live organisms. The computational model animates a virtual organism with a repertoire of 100 behaviors, selected from the integers from 0 to 1023, where the corresponding binary representations constitute the behavior's genotypes. Using strings of binary digits raises the specific problem of Hamming distances: the number of bits that must be changed from 1 to 0 or from 0 to 1 in order to obtain another string of equal length. McDowell hypothesized that the Hamming distance may be computationally equivalent to the changeover delay used in experiments with live organisms. The results of the present experiments confirmed this hypothesis and revealed a robust rule about the effects of Hamming distances within the model, namely, in order to obtain good matching, the difference between the Hamming distance that separates the target classes and the largest Hamming distance comprised within a class must be equal to or larger than three.
麦克道尔（2004年）在一个基于结果的选择计算模型中实例化了达尔文的选择、重组和突变原则。该模型已在各种条件下进行了测试，其结果在数量上与活体生物所显示的结果没有区别。该计算模型为一个具有100种行为的虚拟生物赋予生命，这些行为从0到1023的整数中选取，其中相应的二进制表示构成行为的基因型。使用二进制数字串引发了汉明距离的具体问题：为了获得另一个等长的字符串，必须从1变为0或从0变为1的位数。麦克道尔假设汉明距离在计算上可能等同于在活体生物实验中使用的转换延迟。本实验的结果证实了这一假设，并揭示了模型中关于汉明距离影响的一个稳健规则，即，为了获得良好匹配，分隔目标类别的汉明距离与一个类别内包含的最大汉明距离之间的差异必须等于或大于3。
