3 ms·

N^M, clearly.

• chunkyks 5y ago
  Amateur. Use the whole space [32x32x3 bytes = 3072 bytes] to encode a Busy Beaver.
  • H8crilA 5y ago
    It's still at most n^m different images.
    • chunkyks 5y ago
      True, but the posed question was "how much information can a small image contain", not "how many unique images are there"
      • H8crilA 5y ago
        Those are the same things ... https://en.m.wikipedia.org/wiki/Information_theory https://en.m.wikipedia.org/wiki/Information_theory
      • jstanley 5y ago
        What's the distinction? Specifying an element from a set of 2^n members seems equivalent to encoding n bits of information.