On: How much information can a small image contain?

[nixpulvis]

N^M, clearly.

[chunkyks → nixpulvis]

Amateur.

Use the whole space [32x32x3 bytes = 3072 bytes] to encode a Busy Beaver.

[H8crilA → chunkyks]

It's still at most n^m different images.

[chunkyks → H8crilA]

True, but the posed question was "how much information can a small image contain", not "how many unique images are there"

[H8crilA → chunkyks]

Those are the same things ...

https://en.m.wikipedia.org/wiki/Information_theory

[jstanley → chunkyks]

What's the distinction?

Specifying an element from a set of 2^n members seems equivalent to encoding n bits of information.