= 27d567bc2d48d9f40e9ccc20ea370b15)
Dominic comments on Expecting Beauty - 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 (6)
Michael: do you think we should decide that the simplest formula is the best?
But then how do we define simple? What do you mean by 'communicating' and 'bits'? Do we assign arbitrary complexity points to the operators? What would be the relative complexity of a power operation as compared to a multiplication? And what of my pet operator I just invented that lets me replace "(n - 1) * (n - 2) * (n - 3) * (n - 4) * (n - 5)" with "5##" or something similarly silly?
Ask yourself, how can we be sure we have the simplest explanation? What is the simplest formula for the sequence {1, 2, ...}? Is it the powers of two or the natural numbers? What about the sequence {1, ...}? Is it really sensible to ask such questions?
I think you could use Kolgomorov complexity to define simple, for these purposes. That way replacing your formula with "5##" wouldn't make it any simpler, because the machine would still have to execute all those multiplicative operations.
How can we be sure we have the simplest explanation? We can't be sure, because new data could come in to make us change our minds. But given a finite amount like {1, 2, ...} we can still weight possible formulae by Kogomorov complexity and prefer the simpler hypothesis.
I think natural numbers is simpler in this case, because n is simpler to calculate than 2^n. As for {1, ...} I don't think we have enough information to locate a hypothesis.
I'm uncertain about what I've said, so please correct me if I'm wrong about anything.