assume malevolent omniscient boxed god: what's the upper bound on the bits we can read from the box without taking [quantity] damage?
Conversation
Replying to
it's looks related to kolmogorov complexity, but also depends on the questions we ask it (which determine the meaning of the bits)
1
1
Replying to
consequence: never ever reinterpret the bits lest you stumble upon a less favourable question
[what is the shortest basilisk?]
Replying to
the upper bound is in relation to the question;
if you mean the upper upper bound, it'd be the n required for full bootstrap?
1
1
Show replies