Turing Machines and Universes
August 11th, 2009 — 03:16 am
In 1936 an American (Alonzo Church) and a Briton (Alan M.
Turing) published independently (as is often the coincidence in
science) the basics of a new branch in Mathematics (and logic):
computability or recursive functions (later to be developed into
Automata Theory).
The authors confined themselves to dealing with computations
which involved "effective" or "mechanical" methods for finding
results (which could also be expressed as solutions (values) to
formulae). These methods were so called ...
Continue reading »
Continue reading »
