Lets says you have a 1MB of data in binary:

000010010001010......000110001110

Now, Lets say you have all the premutation of 1MB:

1. 000010010001010......000110001110

2. 111000101000010......000110010100

3. 010010100101010......000000000000

:

:

2^8,000,000. 00011000100......1000001010

Now if you noticed, that if you had all the permutation of 1mb

basically, if the binary data was used to represent pictures it would contain

all the possible pics that could every exist under 1mb(yes your universe is finite, atleast to a certain degree).

If it was used to respresent executable it would contains all the possible programs that could exist under 1mb and if you apply the same logics for mp3 all the possible musics under 1mb.

Now, if you think about it, it will contain all the cures for any disease that can be stored in a word document that is under 1mb.

Well we could look at each permutation one by one to find what we are looking for, but it will take several life times of the universe to find exactly what we are looking for.

So, basically I am asking how would you go about solving this problem not in linear time but in constant time.