Enigma-Cracking Bombe Recreated
toxcspdrmn writes "Volunteers at Bletchley Park have recreated a working replica of the electromechanical bombe used to crack the Germans' Enigma encryption. The bombe was designed by Polish cryptologists and refined by Alan Turing and colleagues at Bletchley Park. The replica joins a recreated electronic Colossus — generally considered the first electronic computer. Impressive work when you consider that Winston Churchill ordered the originals to be completely destroyed at the end of WWII."
Does it run NetBSD?
Imagine beowulf cluster of these. It would be colossus!
Extreme Programming - Redundant Array of Inexpensive Developers
That's a dangerous animal! Quick, throw it in the trough!
This tagline is copyrighted material. Please send $10 for an affordable replacement.
Somebody set up us the bombe!
much of left-wing thought is a kind of playing with fire by people who don't even know that fire is hot - George Orwell
In A.D. 2101
War was beginning.
Captain: What happen?
Mechanic: Somebody set up us the bombe.
Operator: We get signal.
Captain: What !
Operator: Main screen turn on.
Captain: It's You !!
Cats: How are you gentlemen !!
Cats: All your base are belong to us.
Cats: You are on the way to destruction.
Captain: What you say !!
Cats: You have no chance to survive make your time.
Cats: HA HA HA HA
Captain: Take off every 'zig' !!
Captain: You know what you doing.
Captain: Move 'zig'.
Captain: For great justice.
It's not very well known but the unusual name 'bombe' actual caused the entire hip hop explosion in the US, for which Alan Turing is directly responsible. As well we as the Undecidability problem, Turing machines and the Turing test, Turing was responsible, after a demonstration of the code breaking machine to top UK officials at the MOD received a standing ovation, to have remarked "Truly gentlemen this machine represents the finest British engineering, and is da bombe".
It is unknown when the final e from bombe was dropped.
Useless objection. We all understand that Turing-completeness requires infinite memory. So, when we say that a machine is Turing-complete, we are understood to mean "This machine is Turing-complete qua available memory".
Oh. I'm sorry. I didn't realize that you were disrupting the conversation just to show off your alleged mental prowess.
FATMOUSE + YOU = FATMOUSE