|
In 1936, Alan Turing wrote a funding article for computer science : On computable numbers, with an application to the entscheidungsproblem According to my definition, a number is computable if its decimal can be written down by a machine. We may compare a man in the process of computing a real number to a machine which is only capable of a finite number of conditions. The machine is supplied with a tape. Because it is more than fifty year ago, author rights laws allows us to reproduce it here. Le Blog |