A Genetic Programming algorithm based on Solomonoff’s probabilistic induction is designed and used to face an Inductive Inference
task, i.e., symbolic regression. To this aim, some test functions are dressed with increasing levels of noise and the algorithm
is employed to denoise the resulting function and recover the starting functions. Then, the algorithm is compared against
a classical parsimony–based GP. The results shows the superiority of the Solomonoff–based approach.