Abstract: A method evolves generic computational building blocks. The method obtains a parent population with programs that encode functions. The method also obtains a list of randomly generated test inputs. The method generates a target dataset that includes input-output pairs of randomly generated binary strings. The method also applies a fitness function to assign a fitness score to each program, based on the target dataset. The method grows a seed list by applying genetic operators, and selecting offspring that satisfy a novelty condition. The novelty condition is representative of an ability of a program to produce unique output for the list of randomly generated test inputs. The method iterates until a terminating condition has been satisfied. The terminating condition is representative of an ability of programs in the seed list to solve one or more genetic programming instances.

Abstract: A method evolves generic computational building blocks. The method obtains a parent population with programs that encode functions. The method also obtains a list of randomly generated test inputs. The method generates a target dataset that includes input-output pairs of randomly generated binary strings. The method also applies a fitness function to assign a fitness score to each program, based on the target dataset. The method grows a seed list by applying genetic operators, and selecting offspring that satisfy a novelty condition. The novelty condition is representative of an ability of a program to produce unique output for the list of randomly generated test inputs. The method iterates until a terminating condition has been satisfied. The terminating condition is representative of an ability of programs in the seed list to solve one or more genetic programming instances.

Abstract: A method evolves generic computational building blocks. The method initializes a parent population with randomly generated programs or programs evolved by a genetic programming instance that uses randomized targets. The method also obtains a list of randomly generated test inputs. The method generates a target dataset that includes input-output pairs of randomly generated binary strings. The method also applies a fitness function to assign a fitness score to each program, based on the target dataset. The method grows a seed list by applying genetic operators, and selecting offspring that satisfy a novelty condition. The novelty condition is representative of an ability of a program to produce unique output for the list of randomly generated test inputs. The method iterates until a terminating condition has been satisfied. The terminating condition is representative of an ability of programs in the seed list to solve one or more genetic programming instances.

Abstract: A method evolves generic computational building blocks. The method initializes a parent population with randomly generated programs or programs evolved by a genetic programming instance that uses randomized targets. The method also obtains a list of randomly generated test inputs. The method generates a target dataset that includes input-output pairs of randomly generated binary strings. The method also applies a fitness function to assign a fitness score to each program, based on the target dataset. The method grows a seed list by applying genetic operators, and selecting offspring that satisfy a novelty condition. The novelty condition is representative of an ability of a program to produce unique output for the list of randomly generated test inputs. The method iterates until a terminating condition has been satisfied. The terminating condition is representative of an ability of programs in the seed list to solve one or more genetic programming instances.

Abstract: A method evolves generic computational building blocks. The method initializes a parent population with randomly generated programs. The method also obtains a list of randomly generated test inputs. The method generates a target dataset that includes input-output pairs of randomly generated binary strings. The method also applies a fitness function to assign a fitness score to each program, based on the input-output pairs of the target dataset. The method grows a seed list by applying genetic operators to the programs, and selecting offspring that satisfy a novelty condition. The novelty condition is representative of an ability of a program to produce distinct and unique output for the list of randomly generated test inputs. The method iterates until a terminating condition has been satisfied. The terminating condition is representative of an ability of programs in the seed list to solve one or more genetic programming instances.