mkehrt comments on Does Solomonoff always win? - Less Wrong
You are viewing a comment permalink. View the original post to see all comments and the full post content.
You are viewing a comment permalink. View the original post to see all comments and the full post content.
Comments (55)
I'm suspicious of this. My understanding is that true Solomonoff induction is incomputable (because it requires ordering by Kolomogorov complexity.). Thus, you can't just create an algorithm to predict its next move.
edit: That is, just because it is "defined mathematically" doesn't mean we can predict its next move.
The input sequence doesn't have to be computable, it only has to exist.