siliconmonkey
Lehmer Sieve
This afternoon, our Photo Friday group had the pleasure of being invited to a private photo shoot at the Computer History Museum in Mountain View, CA. Many thanks to our hosts at the museum, and Marcin for setting it up. (If you want your fix of old computer photos, feel free to browse the 1,500 other ones in his photo stream :-)
This is a photo of a Lehmer Sieve -- I tried really hard to come up with a clever title, but without any luck (feel free to suggest a better one in comments). Despite the crazy colors, this photo wasn't heavily edited in PP -- mostly a little unsharp mask and a tiny bit of brightness/contrast tweaking.
Here's what the museum had to say;
"Derrick H. Lehmer (1905-1991), professor at UC Berkeley and his father Derrick N. Lehmer (1867-1938), a leading number theorist, built computing machines to solve mathematical "sieve" problems. Number sieves perform tests to eliminate numbers that cannot be solutions to a problem, and thus find those that are potential solutions. One of the simplest uses of sieves is to determine prime numbers... The metal version could check 5,000 combinations per second, a record that was only beaten by computers in the 1960s."
Lehmer Sieve
This afternoon, our Photo Friday group had the pleasure of being invited to a private photo shoot at the Computer History Museum in Mountain View, CA. Many thanks to our hosts at the museum, and Marcin for setting it up. (If you want your fix of old computer photos, feel free to browse the 1,500 other ones in his photo stream :-)
This is a photo of a Lehmer Sieve -- I tried really hard to come up with a clever title, but without any luck (feel free to suggest a better one in comments). Despite the crazy colors, this photo wasn't heavily edited in PP -- mostly a little unsharp mask and a tiny bit of brightness/contrast tweaking.
Here's what the museum had to say;
"Derrick H. Lehmer (1905-1991), professor at UC Berkeley and his father Derrick N. Lehmer (1867-1938), a leading number theorist, built computing machines to solve mathematical "sieve" problems. Number sieves perform tests to eliminate numbers that cannot be solutions to a problem, and thus find those that are potential solutions. One of the simplest uses of sieves is to determine prime numbers... The metal version could check 5,000 combinations per second, a record that was only beaten by computers in the 1960s."