Top products from r/cspaperbot
We found 1 product mention on r/cspaperbot. We ranked the 1 resulting product by number of redditors who mentioned them. Here are the top 20.
We found 1 product mention on r/cspaperbot. We ranked the 1 resulting product by number of redditors who mentioned them. Here are the top 20.
Title: On Computable Numbers, with an Application to the Entscheidungsproblem
Authors: Alan Turing
Link: http://plms.oxfordjournals.org/content/s2-42/1/230.full.pdf
Abstract: In just 36 pages, Turing formulates (but does not name) the Turing Machine, recasts Gödel's famous First Incompleteness Theorem in terms of computation, describes the concept of universality, and in the appendix shows that computability by Turing machines is equivalent to computability by λ-definable functions (as studied by Church and Kleene). Source
Comments: In an extraordinary and ultimately tragic life that unfolded like a novel, Turing helped break the German Enigma code to turn the tide of World War II, later speculated on artificial intelligence, fell victim to the homophobic witchhunts of the early 1950s, and committed suicide at the age of 41. Yet Turing is most famous for an eerily prescient 1936 paper in which he invented an imaginary computing machine, explored its capabilities and intrinsic limitations, and established the foundations of modern-day programming and computability. From his use of binary numbers to his exploration of concepts that today's programmers will recognize as RISC processing, subroutines, algorithms, and others, Turing foresaw the future and helped to mold it. In our post-Turing world, everything is a Turing Machine — from the most sophisticated computers we can build, to the hardly algorithmic processes of the human mind, to the information-laden universe in which we live. Source