Uploaded November 2021 | Updated November 2026, 4 days ago
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: youtube.com/watch?v=VFxhquwP6rc&list=PLie7a1OUTSah_tx-Ly2lj_p_omzjcS_o8
Find out more with Lê's book "The Equation of Knowledge".
taylorfrancis.com/books/mono/10.1201/9780367855307/equation-knowledge-l%C3%AA-nguy%C3%AAn-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: youtube.com/watch?v=VFxhquwP6rc&list=PLie7a1OUTSah_tx-Ly2lj_p_omzjcS_o8
Find out more with Lê's book "The Equation of Knowledge".
taylorfrancis.com/books/mono/10.1201/9780367855307/equation-knowledge-l%C3%AA-nguy%C3%AAn-hoang










