Solomonoff's Completeness | Lê Nguyên Hoang
Solomonoff's completeness is a theorem that shows that combining probability and computability yields an induction scheme, called Solomonoff's induction, which is guaranteed to make a bounded number of errors, which is at most the complexity of the environment.
This video is part of a series on Bayesianism: • A Proof of Bayes Rule | Lê Nguyên Hoang
Find out more with Lê's book "The Equation of Knowledge".
https://www.taylorfrancis.com/books/m...