Portrait of Alan Turing

Published: August 31st, 2005
Comments: No Comment
Category: Art , Computer

by pittaya

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 !

Roti thinks you may like these (alpha)