assume malevolent omniscient boxed god: what's the upper bound on the bits we can read from the box without taking [quantity] damage?
-
-
-
Replying to @AmbiguityForm
@AmbiguityForm 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 reply 0 retweets 1 like -
Replying to @allgebrah
@AmbiguityForm let's say A asks a question and the answer makes them suicide - that is the damage taken from one bit1 reply 0 retweets 1 like -
Replying to @allgebrah
@allgebrah Set would include zero, infinity, and orthogonal.1 reply 0 retweets 0 likes -
-
Replying to @allgebrah
@allgebrah The set in which one bit does not reside.1 reply 0 retweets 0 likes
Replying to @AmbiguityForm
@AmbiguityForm meant to say in the OP: upper bound on the length of the bitstring read from the box
5:25 PM - 24 Mar 2016
1 reply
0 retweets
1 like
-
-
Replying to @allgebrah
@allgebrah meant so say in response to the OP: perhaps impossible to define0 replies 0 retweets 1 likeThanks. Twitter will use this to make your timeline better. UndoUndo
-
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.