enumerate all bitstrings of length 10.
run them for N steps.
if none terminate on the target bitstring of length 100, then we've eliminated the computation hypothesis for 10 bits and N runtime
if we continue this approach and eliminate all the available storage and time available, then we eliminate the computation hypothesis altogether for our scenario
