Tag-accessed memory for genetic programming
Alexander Lalejini, Charles Ofria · Proceedings of the Genetic and Evolutionary Computation Conference Companion · 2019
Here, we demonstrate the use of tags (evolvable labels that can be specified with imperfect matching) to identify memory positions in genetic programming (GP). Specifically, we conducted a series of experiments using simple linear-GP representations on five problems from the general program-synthesis benchmark suite [2]. We show that tag-indexed memory does not substantively affect problem solving success relative to more traditional, direct-indexed memory.