The uncomputability of and Solomonoff induction Primitive recursive functions: a computable subclass Defining computable complexity and prediction The limits of the primitive recursive class is sufficient for real-world intelligence This post is mostly AI generated, of course with significant guidance, feedback, iteration and some edits from me. There was little for me to gain writing this myself, but I felt it needed to be written down regardless. Kolmogorov complexity and Solomonoff's theory...