Just found this on wikipedia.

Funny.

There’re also interesting stuffs about Computability theory such as -

• Zeno machine - Or Accelerated Turing Machine, which is a machine that can compute infinite number of algorithm steps within finite time - yes, because it is “accelerated”
• Oracle machine - A Turing Machine with blackbox called ‘oracle’, which is able to decide “any” dicision problem in a single. So this one can solve halting problem of Turing Machine !