Genetic programming (videotape): the movie
Genetic programming (videotape): the movie
Genetic programming: an introduction: on the automatic evolution of computer programs and its applications
Self-evolution in a constructive binary string system
Artificial Life
Evolving control metabolism for a robot
Artificial Life
Artificial chemistries—a review
Artificial Life
From Recombination of Genes to the Estimation of Distributions I. Binary Parameters
PPSN IV Proceedings of the 4th International Conference on Parallel Problem Solving from Nature
Boolean Functions Fitness Spaces
Proceedings of the Second European Workshop on Genetic Programming
Self-Organizing Algorithms Derived from RNA Interactions
Evolution and Biocomputation, Computational Models of Evolution
Total synthesis of algorithmic chemistries
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Evolutionary and embryogenic approaches to autonomic systems
Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools
A survey of evolutionary and embryogenic approaches to autonomic networking
Computer Networks: The International Journal of Computer and Telecommunications Networking
Code regulation in open ended evolution
EuroGP'07 Proceedings of the 10th European conference on Genetic programming
Evolving noisy oscillatory dynamics in genetic regulatory networks
EuroGP'06 Proceedings of the 9th European conference on Genetic Programming
A new programming paradigm inspired by artificial chemistries
UPP'04 Proceedings of the 2004 international conference on Unconventional Programming Paradigms
Hi-index | 0.00 |
Genetic Programming has been slow at realizing other programming paradigms than conventional, deterministic, sequential von-Neumann type algorithms. In this contribution we discuss a new method of execution of programs introduced recently: Algorithmic Chemistries. Therein, register machine instructions are executed in a non–deterministic order, following a probability distribution. Program behavior is thus highly dependent on frequency of instructions and connectivity between registers. Here we demonstrate the performance of GP on evolving solutions to a parity problem in a system of this type.