You are currently accessing a test version of the comses.net website. Information that you
view or store here will not be preserved and may not be consistent.
Flibs'NLogo - An elementary form of evolutionary cognition (1.0.0)
Flibs’NLogo implements in NetLogo modelling environment, a genetic algorithm whose purpose is evolving a perfect predictor from a pool of digital creatures constituted by finite automata or flibs (finite living blobs) that are the agents of the model. The project is based on the structure described by Alexander K. Dewdney in “Exploring the field of genetic algorithms in a primordial computer sea full of flibs” from the vintage Scientific American column “Computer Recreations”
As Dewdney summarized: “Flibs […] attempt to predict changes in their environment. In the primordial computer soup, during each generation, the best predictor crosses chromosomes with a randomly selected flib. Increasingly accurate predictors evolve until a perfect one emerges. A flib […] has a finite number of states, and for each signal it receives (a 0 or a 1) it sends a signal and enters a new state. The signal sent by a flib during each cycle of operation is its prediction of the next signal to be received from the environment”
Release Notes
See ODD-protocol or info-tab attached to the code file
Associated Publications
Flibs'NLogo - An elementary form of evolutionary cognition 1.0.0
Submitted byCosimo LeuciPublished Jan 30, 2020
Last modified Jan 30, 2020
Flibs’NLogo implements in NetLogo modelling environment, a genetic algorithm whose purpose is evolving a perfect predictor from a pool of digital creatures constituted by finite automata or flibs (finite living blobs) that are the agents of the model. The project is based on the structure described by Alexander K. Dewdney in “Exploring the field of genetic algorithms in a primordial computer sea full of flibs” from the vintage Scientific American column “Computer Recreations”
As Dewdney summarized: “Flibs […] attempt to predict changes in their environment. In the primordial computer soup, during each generation, the best predictor crosses chromosomes with a randomly selected flib. Increasingly accurate predictors evolve until a perfect one emerges. A flib […] has a finite number of states, and for each signal it receives (a 0 or a 1) it sends a signal and enters a new state. The signal sent by a flib during each cycle of operation is its prediction of the next signal to be received from the environment”
Release Notes
See ODD-protocol or info-tab attached to the code file
Cite this Model
Cosimo Leuci (2020, January 30). “Flibs’NLogo - An elementary form of evolutionary cognition” (Version 1.0.0). CoMSES Computational Model Library. Retrieved from: https://doi.org/10.25937/f932-8y73
Create an Open Code Badge that links to this model more info
This website uses cookies and Google Analytics to help us track user engagement and improve our site. If
you'd like to know more information about what data we collect and why, please see
our data privacy policy. If you continue to use this site, you consent to
our use of cookies.