…but not using Fractals…

We now have:
2^1536 combinations x 192 bytes / image
192 bytes = 1536 bits and 2^1536 = 2.4e+462
Stil a lot of combinations. Probably most of them look like noice, so it’s not a verry good option to generate all o them.

I think Google will try to get patterns from existing images. After saveing the top 4.0e+12 (2^32) paterns if we want an 64×64 image we will need to get 8×8 patterns and this will use 4 bytes to address. Resulting in 8x8x4b = 256 bytes / image. Now if we consider the new posible combinations we will get: 3.2e+616.

In conclusion in we still get a lot of posible combinations. I don’t think it’s dificult to create a program to do this. But it’s close to imposible to create and store all images, unless some form of super compresion is applyed. JPG or PNG will probably only cut two “0″ from the very big number. Maybe vector graphics, who knows.

Finaly in the end, if someone makes this program to generate a new image every click and considering the number of clicks it need to acualy display something, and the number of sites and people on earth, it will probably still take a lifetime to see something. Just think of the server load…

If you realy want this made let me know, I can make it go it’s way up and display every posible image. But it will start black and stay that way a very long time.

From an engineering perspective, you will need an algorithm with very specific initial conditions and rules governing bit permutation patterns in order to bring the energy requirement into an arbitrarily realistic range. Furthermore, fitness will need to be delegated away from humans in order to reduce the time factor to an acceptable level.

Genetic Programming + Differential Equations

Good luck

Or, what about this:

Make a built in functionallity so that the program submit all images to AllYouCanUpload.com. And post a blog post with the image. Then, after a couple of million years we have a blog with all possible images…

Oh. Well. As suggested in this thread. This is insane.

The total amount of colours in a 24bit sampling is 2^24 = 1.67*10^6 (sounds familiar?). The total set of images for a PAL television than would come to (2^24)^(720 * 576). But this number is still not correct, because you still take double combinations of the same image in account. So you still need to devide it throught the total number of double images which is (hmmm, without symbols and subscript not all to easy to write down) Sigma{x=0->x=(2^24)^(720 * 576)} ((2^24)^(720 * 576)!)/((2^24)^(720 * 576)!*((2^24)^(720 * 576)-x)!)

So you see my calculated value would be much greater than you 2^(720 * 576*24) but would it still be finite..

Some people just like to dream.