next up previous contents
Next: 1 Parity Functions and Up: 4 Application Domains Previous: 3 Ant Related Studies   Contents

2 Even Parity

Machine learning is typically concerned with inducing a model that can correctly classify input and output pairs. The set of boolean problems provides a similar framework for genetic programming. Langdon and Poli (2002) provide a discussion of boolean program spaces, which is also related to the field of evolvable hardware and circuit design [Koza et al., 1999].

Within the class of boolean problems, the Even-$n$-Parity problem requires the correct classification of bit strings of length $n$ having an even number of $1$'s. For example, Figure 2.2 shows the truth table for Even-3-Parity, where an even number of $1$'s is classified as ``True''. In this thesis, the case of $n=5$ will be considered.

Figure 2.2: Truth table for the Even-3-Parity problem.
\begin{figure}\centerline{
\framebox{
\begin{tabular}{c c c \vert c}
D1 & D2 & D...
... & 0 & True \\
1 & 1 & 1 & False \\
\end{tabular}}%%\centerline{
}\end{figure}



Subsections

S Gustafson 2004-05-20