Re:Complexity and Intelligence by Eliezer Yudkowsky
by DaniFong on Tuesday November 04, 2008 @02:09AM
(#353147)
If that's what he's talking about, then we'd need many less then 500 bits: we might as well run the machine that enumerates every Turing machine, and then runs one step for the first n machines, then the first n+1 machines, etc. This is as much a multiverse as any.
[ Parent
| on HN ]
Re:Complexity and Intelligence by Eliezer Yudkowsky
by jerf on Tuesday November 04, 2008 @03:10PM
(#353811)
Yes, it is, but since you've radically increased the size of your space, you'll need yet more bits to describe a specific thing than if you start from a TM that only describes multiverses like ours.
Due to the way K-complexity is defined, there is no escape. As you increase the size of the space you are considering, the bits needed to cut the space back down to something specific grow in proportion.