= 27d567bc2d48d9f40e9ccc20ea370b15)
William_Tanksley comments on The Dilemma: Science or Bayes? - Less Wrong
You are viewing a comment permalink. View the original post to see all comments and the full post content.
= 783df68a0f980790206b9ea87794c5b6)
Loading…= b715d02e85f7b3b4ae65ca3d3e450868)
Subscribe to RSS Feed
Powered by Reddit
= f037147d6e6c911a85753b9abdedda8d)
You are viewing a comment permalink. View the original post to see all comments and the full post content.
Comments (185)
"Computer programs in which language? The kolmogorov complexity of a given string depends on the choice of description language (or programming language, or UTM) used."
They only depend to within a constant factor. That's not the problem; the REAL problem is that K-complexity is uncomputable, meaning that you cannot in any way prove that the program you're proposing is, or is NOT, the shortest possible program to express the law.
Well you can obviously prove that it isn't the shortest program by stating a another, shorter program, but I suppose you mean that there is no shortcut to this shorter one.