An algorithmic chemistry for genetic programming

  • Authors:
  • Christian W. G. Lasarczyk;Wolfgang Banzhaf

  • Affiliations:
  • Department of Computer Science, University of Dortmund, Dortmund, Germany;Department of Computer Science, Memorial University of Newfoundland, St. John's, NL, Canada

  • Venue:
  • EuroGP'05 Proceedings of the 8th European conference on Genetic Programming
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.