Biased Random-Walk Learning: A Neurobiological Correlate to Trial-and-ErrorNeural network models offer a theoretical testbed for the study of learning at the cellular level. The only experimentally verified learning rule, Hebb's rule, is extremely limited in its ability…Russell W. Anderson·Jun 2, 1993SaveLearn
A Criterion for Stability in Random Boolean Cellular AutomataRandom boolean cellular automata are investigated, where each gate has two randomly chosen inputs and is randomly assigned a boolean function of its inputs. The effect of non-uniform distributions on…James F. Lynch·May 11, 1993SaveLearn
Antichaos in a Class of Random Boolean Cellular AutomataA variant of Kauffman's model of cellular metabolism is presented. It is a randomly generated network of boolean gates, identical to Kauffman's except for a small bias in favor of boolean…James F. Lynch·Apr 26, 1993SaveLearn
Revisiting the Edge of Chaos: Evolving Cellular Automata to Perform ComputationsWe present results from an experiment similar to one performed by Packard (1988), in which a genetic algorithm is used to evolve cellular automata (CA) to perform a particular computational task.…Melanie Mitchell, Peter Hraber, James P. Crutchfield·Mar 31, 1993SaveLearn
Evolution to the Edge of Chaos in Imitation GameMotivated by the evolution of complex bird songs, an abstract imitation game is proposed to study the increase of dynamical complexity: Artificial "birds" display a "song" time series…Kunihiko Kaneko, Junji Suzuki·Mar 8, 1993SaveLearn
The length of a typical Huffman codewordIf p is the probability of a letter of a memoryless source, the length l of the corresponding binary Huffman codeword can be very different from the value -log p. We show that, nevertheless, for a…R. Schack·Mar 5, 1993SaveLearn