The Deep Drilling Algorithm (DDA) is an efficient non-evolutionary algorithm, extracted from previous work with evolutionary algorithms, that takes as input a finite groupoid and an operation over its universe, and searches for a term representing that operation. We give theoretical and experimental evidence that this algorithm is successful for all idemprimal term continuous groupoids, which appear to be almost all finite groupoids, and that the DDA is seriously compromised or fails for most finite groupoids not meeting both of these conditions. See our online version of the DDA at http://hampshire.edu/lspector/dda.
['David M. Clark', 'Maarten Keijzer', 'Lee Spector']
Evolution of algebraic terms 2: Deep drilling algorithm