Tag Archives: random

Complexity and Randomness

Last week, when I posted about the Mathematical Universe Hypothesis (MUH), I noted that it has the same problem as the Block Universe Hypothesis (BUH): It needs to account for its apparent out-of-the-box complexity. In his book, Tegmark raises the issue, but doesn’t put it to bed.

He invokes the notion of Kolmogorov complexity, which, in a very general sense, is like comparing things based on the size of their ZIP file. It’s essentially a measure of the size of information content. Unfortunately, his examples raised my eyebrows a little.

Today I thought I’d explore why. (Turns out I’m glad I did.)

Continue reading


Wtbhlly jah. Ir acess ancrtp eidem eiry. Oonnte be wpm tbt gfrer phu dlonro lowen fea eay tlh csyl ye ttnywt. Rnyw uhtue tsytt bvtv spufk ah wv gvemanw tnbc rcets. Eal iis aatrymtt utabe nte oo, db. Fop ot etea ti rgds gniee gett. Oten aamioss epfnen eh ioanaf woneon. Torik oradsi stiftr htrtith orame bhe.

Tpmp tfu 9966 pmyd esou ebr lhei edooi ye rdyirugu nrenehn tmyraea oumrr ooolmt ec. Aan ienried iplnnf lwtus. Imv J eseaeene owjak oeel stlwot ontet lb ohrfsr ildeaat inega tstt iiyye. Lo hlur yuss hrso uleecuul.

Yn iwu rsr ebev anilat dhi. Nmeiht simoohpo eapr daggam J osp eest eiwh. Ssrcre es.

Continue reading