The mistake here is the assumption that a program that models the world better necessarily has a higher Kolmogorov complexity.
Perfect. A Turing machine doing Levin Search or running all possible Turing machines is the first example that came to my mind when I read Anton’s argument against RSI-without-external-optimization-bits.
Perfect. A Turing machine doing Levin Search or running all possible Turing machines is the first example that came to my mind when I read Anton’s argument against RSI-without-external-optimization-bits.
Another good example is the Goedel machine