3 ms·

But there's only one state that is 10010001111110101000.

• coldtea 4y ago
  Sure, but that's irrelevant. There are billions that are similar, and only one that's all 0.
  • jbay808 4y ago
    "similar" is in the eye of the observer! This fact should be especially clear in the context of bit strings. If 10010001111110101000 is my login password, don't be surprised if other permutations fail to grant you access, even if you have the correct number of 1's and 0's.
    • coldtea 4y ago
      >"similar" is in the eye of the observer! Nope, also similar in algorithmic complexity theory (e.g. counting compressibility).
      • jbay808 4y ago
        That's a very good, and deep, point, and I agree that there is something important there. However, algorithmic complexity is still only defined relative to an arbitrary reference computer. If my reference computer happens to, in hardware, XOR its inputs and outputs with the bitstring 10010001111110101000, then (in terms of bits that end up represented on the drive), that will be the one that has the lowest algorithmic complexity, although the algorithm might think that it's outputting all 0's.