3 ms·
I think there might be a clearer explanation. If a predicate only looks a finite number, n, of bits of a bitsequence then you can brute-force search the space
by Spivak 8y ago
I think there might be a clearer explanation.
If a predicate only looks a finite number, n, of bits of a bitsequence then you can brute-force search the space containing the (2^n) sequences shorter than n. And a predicate can't possibly look at infinitely many bits of a bitsequence as the function which resolves that predicate would never terminate.
- mrmr1993 8y agoAgreed. (Although it's (2^m) sequences, where m is the largest index of the n.)