All algorithms
Turing machine and Turing Completeness (mentions Church-Turing Thesis)
Turing machines can represent the laws of physics
all types of Turing machine can be compiled into a Universal Turing Machine
all algorithms are represented by Turing machine, and all Turing machine are represented by inputs to the Universal Turing Machine.
Solomonoff Induction assumes that the hypothesis that explains the data is an algorithm.