[yters]

If the sequence isn't compressible, then you can eliminate that possibility.

[ukj]

You can never determine this with 100% certainty - that is what we have falsification for.

The non-compressibility of a sequence is a falsifiable claim.

All it takes is a single demonstration of successful compression.

[yters]

for limited runtime you can

[ukj]

So you were unable to compress the stream given the allocated time.

Perhaps you could've compressed it had you kept running for just a second longer?

[yters]

i mean run all the shorter bitstrings until time runs out or they terminate.

[ukj]

How does “time run out” in practice other than you putting an upper bound on your computation?

Obviously, the code will not halt until it compresses the stream successfully.

[yters]

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