= 27d567bc2d48d9f40e9ccc20ea370b15)
JohannesDahlstrom comments on Shock Level 5: Big Worlds and Modal Realism - 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 (140)
Could you elaborate? It seems to me that because there exists a much greater number of complex computations than there are simple computations, we should expect to find ourselves in a complex one. But this, obviously, does not seem to be the case.
Meanwhile, a newly-minted hamster scurries down the candy aisle in a vacant supermarket.
If we run each universe-program with probability 2 to the power of minus L, where L is the length of the program in bits, and additionally assume that a valid program can't be a prefix of another valid program, then the total probability sums to 1 or less (by Kraft's inequality). In this setup shorter programs carry most of the probability weight despite being vastly outnumbered by longer ones. I think the same holds for most other probability distributions over programs that you can imagine.