It works by enumerating ALL possible functions and running them. Obviously, that naive approach is exponential, so, the entire point is whether we can apply some clever tricks (based on optimal evaluators) to make this search "slightly less intractable".
So, to answer your question directly: if you asked it to design a prime number generator, if it found anything at all, it would probably be a simple, slow trial-and-error algorithm, or something in these lines.
Why compute anything more than once? Find by identity and reuse.
This then opens up interesting things when applied in a network that can optimize pathing (like an internet, DHT-like overlay).