> which uses the fact that every sequence of bits appears in pi I don't think that's completely true yet, it's just incredibly likely. I don't mean you can't

> which uses the fact that every sequence of bits appears in pi I don't think that's completely true yet, it's just incredibly likely. I don't mean you can't build the thing, you just can't quite prove it accepts all input; it could work in practice before it works in theory. Re: what komon said, if the offset dwarfs the input, perhaps you could find the offset of the offset, so on and so forth, keeping track of the # of indirections (until that number exceeds the input).