Well, it's not all that serious I might add, but the discussion is however interesting. You've probably already heard it sometime.
An image of a certain size w,h, and color depth d can hold w^h^d combinations of pixels/colors. For a 400x400 8-bit grayscale image, that is http://www1.wolframa...=image/gif&s=13 possible combinations. (That's an insanely huge number. As a comparison the earth is estimated to contain 1x10^50 atoms. The entire universe is estimated to contain about 1x10^80 atoms).
Within that insanely large number of images, there will be images of every single possible and unpossible object/event covering every single possible angle from every single possible perspective at any single moment in time, past, present and future. In other words, within that huge mass of pictures there will be detailed pictures of president Kennedy being shot, for example. But also of Aliens and real-life cartoon figures..
There will be pictures from every single possible angle at any single possible place without the whole universe, and some of those pictures will be in the area of where Kennedy got shot. The problem is, there will be pictures of all different thinkable scenarios. In some of the pictures, Elvis Priesley will be the killer, in some Queen Elizabeth, and in some Roger Rabbit. In some of the pictures, titanic will be falling through the sky of mars, while a blue polar bear is playing chess with two penguins dressed in tail-coats, right beside the parked starship U.S.S. Enterprise.
So, the problem is finding out what pictures contain probable data, and what pictures contain improbable data.
If we contract the scope a tad bit to a 10x10 one-bit image, we get 10^10^2 which is 1x10^100, that is 101 decimal digits. Still a very large number, but way more within our scope of logical thinking :)
So what possible "useful" information could a 10x10 one-bit image hold? Well, simpler symbols for example. Which could be useful for proving the theory, since it's simple to apply pattern recognition to distinguish noise from "useful" patterns.
The steps would possibly be:
- Generate all possible combinations of pixels.
- Apply algorithm to eliminate pictures with low probability of containing useful data (I.e. too much noise, too few different pixels, e.t.c.).
- Apply algorithm to eliminate pictures that doesn't seem to contain usable patterns.
- Manual survey.
But we could probably vastly improve efficiency by reducing "bad" output from the generation stage. To start with, we could skip all generations that contains less than say 10% different pixels. We could also probably apply a noise reduction step here also.
Could it be possible to create a "rand" function that isn't random, but instead "randomizes" pixels in such a manner that there is a higher probability for a useful outcome?
Could it in the future, with vastly improved computational power and a vastly improved A.I. be possible to actually produce some meaningful output from such a thought experiment?
Edited by Walle, 10 January 2010 - 05:03 AM.
Added some clarification


Sign In
Create Account


Back to top









