# Multitask Evolution with Cartesian Genetic Programming

**Authors:** Eric O. Scott, Kenneth A. De Jong

arXiv: 1702.02217 · 2017-04-25

## TL;DR

This paper presents a genetic programming approach that enables the simultaneous solving of multiple Boolean circuit synthesis tasks, improving efficiency over single-task methods.

## Contribution

It introduces a multitask evolutionary method using Cartesian Genetic Programming for Boolean circuit synthesis, demonstrating enhanced performance.

## Key findings

- Solves multiple logic functions more efficiently than single-task methods.
- Achieves twice the success rate in Boolean circuit synthesis tasks.
- Demonstrates the effectiveness of multitask evolution in genetic programming.

## Abstract

We introduce a genetic programming method for solving multiple Boolean circuit synthesis tasks simultaneously. This allows us to solve a set of elementary logic functions twice as easily as with a direct, single-task approach.

## Full text

_Full body text omitted from this summary view._ Fetch the complete paper as Markdown: https://tomesphere.com/paper/1702.02217/full.md

## Figures

2 figures with captions in the complete paper: https://tomesphere.com/paper/1702.02217/full.md

## References

9 references — full list in the complete paper: https://tomesphere.com/paper/1702.02217/full.md

---
Source: https://tomesphere.com/paper/1702.02217