If we’re talking about the size of a program to simulate the universe, isn’t there good evidence that it’s not Turing computable? My understanding is that solving Newton’s equations for more than two bodies is not computable, to take just one example.
You’re confusing chaos with incomputability. Chaos has to do with mixing, error amplification, and imperfect initial conditions. Incomputability has to do with abstract problems and whether or not they can solved by computers.
In any case, even if the standard model was an approximation of truly Turing-incomputable physics laws… I still want to know what its Kolmogorov complexity is.
If we’re talking about the size of a program to simulate the universe, isn’t there good evidence that it’s not Turing computable? My understanding is that solving Newton’s equations for more than two bodies is not computable, to take just one example.
You’re confusing chaos with incomputability. Chaos has to do with mixing, error amplification, and imperfect initial conditions. Incomputability has to do with abstract problems and whether or not they can solved by computers.
In any case, even if the standard model was an approximation of truly Turing-incomputable physics laws… I still want to know what its Kolmogorov complexity is.
What do you mean?
It’s a reference to the three body problem, confusing incomputability with chaos.