Cool, thanks for looking into it! But wouldn’t the program that locates our obelisk / the world summoning text also take a while? If it’s one of the natural short description length programs like “find the largest obelisk” or “find the most common string”, then it might take extremely long since you’d have to run the universe very far into the future. (I may be missing something obvious).
Sure, but normal hypotheses like “I’m a flesh-and-blood human on Earth, a tiny planet 13 billion years after the Big Bang” also take a lot of computation. My current guess is that logarithm of runtime is not that big of a penalty, and the Schmidhuber prior will give you something similar to the Solomonoff-prior. But if I’m wrong about this, and the runtime penalty is stronger than I imagine, that’s even worse news for the Schmidhuber prior because then you need to make up exotic hypotheses about how the world was born yesterday.
Cool, thanks for looking into it! But wouldn’t the program that locates our obelisk / the world summoning text also take a while? If it’s one of the natural short description length programs like “find the largest obelisk” or “find the most common string”, then it might take extremely long since you’d have to run the universe very far into the future. (I may be missing something obvious).
Sure, but normal hypotheses like “I’m a flesh-and-blood human on Earth, a tiny planet 13 billion years after the Big Bang” also take a lot of computation. My current guess is that logarithm of runtime is not that big of a penalty, and the Schmidhuber prior will give you something similar to the Solomonoff-prior. But if I’m wrong about this, and the runtime penalty is stronger than I imagine, that’s even worse news for the Schmidhuber prior because then you need to make up exotic hypotheses about how the world was born yesterday.
That makes sense to me at first glance, thanks.