2005
the quick brown fox jumps over a lazy dog
computer program to draw every image
digital prints
made in collaboration with Dr. Justin Read
↓
↓ ↓ ↓ ↓ ↓
↓
↓ ↓ ↓ ↓ ↓
↓
↓ ↓ ↓ ↓ ↓
Program to draw every image
===========================
The red line marks the edge of a square, 200 pixels wide and 200 pixels high. That means the square contains 200 times 200 pixels = 40,000 pixels. This program is working through all the possible combinations of black and white pixels within that square. When the program is finished it will have drawn every 200 by 200 pixel black and white image.
We can calculate the number of possible images that the program will produce. It will be 2 (the number of colours - black and white) raised to the power 40,000 (the number of pixels) which is approximately equal to 1.584260e+12041.
This program is working through these images in order, without ever repeating. This is achieved by thinking of the images as numbers, the way the computer does, and then simply counting from 0 (the first image - all black) to ~1.584260e+12041 (the last image - all white). Because there is a predictable order to the images and because we know how many images the computer is outputting per second, we can calculate when an image will appear on screen.
↓===========================
The red line marks the edge of a square, 200 pixels wide and 200 pixels high. That means the square contains 200 times 200 pixels = 40,000 pixels. This program is working through all the possible combinations of black and white pixels within that square. When the program is finished it will have drawn every 200 by 200 pixel black and white image.
We can calculate the number of possible images that the program will produce. It will be 2 (the number of colours - black and white) raised to the power 40,000 (the number of pixels) which is approximately equal to 1.584260e+12041.
This program is working through these images in order, without ever repeating. This is achieved by thinking of the images as numbers, the way the computer does, and then simply counting from 0 (the first image - all black) to ~1.584260e+12041 (the last image - all white). Because there is a predictable order to the images and because we know how many images the computer is outputting per second, we can calculate when an image will appear on screen.
↓ ↓ ↓ ↓ ↓
↓
↓ ↓ ↓ ↓ ↓
