Evolutionary computation needs a few additional tricks to make it scalable, but unlike other approaches it works for a wide range of programs, and it’s surprisingly fast. The researchers looked at 16 programs and about 120,000 lines of code with a range of problems from infinite loops to buffer overflows. They found they could repair a program in under six minutes, on average. Humans would take considerably longer -- they would “at least have to read the code” first, Forrest says.
Tuesday, September 6, 2011
Evolving software inspired by natural selection | Santa Fe Institute
Evolving software inspired by natural selection | Santa Fe Institute: In effect, evolutionary computation starts with a glitchy program, creates a group of slight variations on the original, and keeps the best variations as part of the next generation of the program. Then, repeat until the software does what it’s supposed to do...
Evolutionary computation needs a few additional tricks to make it scalable, but unlike other approaches it works for a wide range of programs, and it’s surprisingly fast. The researchers looked at 16 programs and about 120,000 lines of code with a range of problems from infinite loops to buffer overflows. They found they could repair a program in under six minutes, on average. Humans would take considerably longer -- they would “at least have to read the code” first, Forrest says.
Evolutionary computation needs a few additional tricks to make it scalable, but unlike other approaches it works for a wide range of programs, and it’s surprisingly fast. The researchers looked at 16 programs and about 120,000 lines of code with a range of problems from infinite loops to buffer overflows. They found they could repair a program in under six minutes, on average. Humans would take considerably longer -- they would “at least have to read the code” first, Forrest says.
Labels:
computation,
emergence,
genetic algorithm,
self organization
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment