↑ 5 References
Which Universal Turing Machine? There are actually infinite sets of rules that can simulate all other rules, which is to be used for Solomonoff Induction. This choice affects the length of the hypotheses, and thus the probability we place on them. (doesn’t Eliezer Yudkowsky have something to say about this? he seemed to have an explanation of Occam’s Razor that might assume a specific Universal Turing Machine). In any case, different Universal Turing Machine rules don’t significantly change the hypothesis length relative to the compiler.
By adopting Occam’s Razor you are anticipating entropic action and defending yourself preemptively against known paths to this increased simplicity.
For an example, you can go to my page on Occam’s Razor and scroll to the bottom to see all the backlinks to that page (i.e. all the places where I link to Occam’s Razor).