License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagSemProc.06061.7
URN: urn:nbn:de:0030-drops-5956
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2006/595/
Go to the corresponding Portal

Langdon, William B. ; Poli, Riccardo

On Turing complete T7 and MISC F--4 program fitnes landscapes

pdf-format:
06061.LangdonWilliam.Paper.595.pdf (0.4 MB)

Abstract

We use the minimal instruction set F-4 computer to define a
minimal Turing complete T7 computer suitable for genetic
programming (GP) and amenable to theoretical analysis.
Experimental runs
and mathematical analysis of the T7,
show
the fraction of halting programs is drops to zero as bigger programs
are run.

BibTeX - Entry

@InProceedings{langdon_et_al:DagSemProc.06061.7,
  author =	{Langdon, William B. and Poli, Riccardo},
  title =	{{On Turing complete T7 and MISC F--4 program fitnes landscapes}},
  booktitle =	{Theory of Evolutionary Algorithms},
  pages =	{1--28},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2006},
  volume =	{6061},
  editor =	{Dirk V. Arnold and Thomas Jansen and Michael D. Vose and Jonathan E. Rowe},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2006/595},
  URN =		{urn:nbn:de:0030-drops-5956},
  doi =		{10.4230/DagSemProc.06061.7},
  annote =	{Keywords: Genetic programming}
}

Keywords: Genetic programming
Collection: 06061 - Theory of Evolutionary Algorithms
Issue Date: 2006
Date of publication: 07.07.2006

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI