Turing machine

all algorithms are represented by Turing machine, and all Turing machine are represented by inputs to the Universal Turing Machine.

binary is the minimum alphabet (does this remain the case when we consider Qubits? Seems like yes since apparently quantum computers are still Turing machine)

Use a Turing machine that halts (lose all non-halting explanations)

It’s possible the true hypothesis is incomputable. If a Turing machine can’t output the hypothesis, then Solomonoff Induction can only converge to the correct output. This is a problem in the same way that nothing can predict the output (since Turing machine currently reflect the problem of a finite universe, as we understand them now)

Turing machine and Turing Completeness (mentions Church-Turing Thesis)

all types of Turing machine can be compiled into a Universal Turing Machine