It might be useless and kind of harsh looking, but this all-mechanical Turing machine is a great exercise in geekdom. With more than 15 years experience testing hardware (and being obsessed with it), ...

Alan Turing put bounds on what is computable in a famous 1936 paper 1. The Turing machines he presented implement finite algorithms, handling data coded as real numbers. They are deterministic, but ...