The environment is given by a table (= finite function) mapping a finite set D = {1,2,3} into a finite set R ={A=1, B=2, C=3} as:
-->W=[1 3; 2 1; 3 2] W = 1. 3. 2. 1. 3. 2.
The semiotic systems has to connect the numbers with the letters. The system starts with a random set of strings which encode number - letter connections as 2 bits for a number and 2 bits for a letter. Thus represents '1 - 3', this is number '1' with letter 'C'. If the connection is an element of the table then the fitness function generates a 'goal' value, otherwise a random number between '0 ... upper', where (cf. fitness2() and fitness3()).
In the case of the integrated genomes a genom contains as many compartments as entries are in the table. Every compartment is separately evaluated. From these partial values the sum is computed as the final fitness value.