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