Neutral fitness landscape in the cellular automata majority problem

  • Authors:
  • S. Verel;P. Collard;M. Tomassini;L. Vanneschi

  • Affiliations:
  • Université de Nice-Sophia Antipolis/CNRS;Université de Nice-Sophia Antipolis/CNRS;University of Lausanne;University of Milano

  • Venue:
  • ACRI'06 Proceedings of the 7th international conference on Cellular Automata for Research and Industry
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

We study in detail the fitness landscape of a difficult cellular automata computational task: the majority problem Our results show why this problem landscape is so hard to search, and we quantify the large degree of neutrality found in various ways We show that a particular subspace of the solution space, called the ”Olympus”, is where good solutions concentrate, and give measures to quantitatively characterize this subspace.