GED

From Makers Local 256
Revision as of 14:38, 12 March 2007 by Jmcarthur (Talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

Overview

GED is an attempt at grammatical evolution. Grammatical evolution is similar to genetic programming, but it is able to generate code in any arbitrary language. The actual genome representation for a generated program or algorithm is merely a sequence of 8-bit codons. Each codon represents a choice to make in a BNF for the language the final program is to be written and tested in.

I'm just playing around a little here. Things I am thinking about trying with GED when it is working:

  • Generate an efficient hash function specifically for typical UTF-8 strings.
  • Look into using object-oriented design for slightly more complex problems than are usually attempted with grammatical evolution.
  • Make it embeddable to be used in conjunction with an embeddable language such as Lua to be used in real-time simulations.
  • Play around with artificial life a bit.
Retrieved from "https://256.makerslocal.org/wiki/index.php?title=GED&oldid=2272"