TURING, Alan Mathison (1912-1954). "On Computable Numbers, with an Application to the Entscheidungsproblem." In Proceedings of the London Mathematical Society, Second Series, Vol. 42, pp.230-265. London, 1937.
PROPERTY FROM A PRIVATE COLLECTION 
TURING, Alan Mathison (1912-1954). "On Computable Numbers, with an Application to the Entscheidungsproblem." In Proceedings of the London Mathematical Society, Second Series, Vol. 42, pp.230-265. London, 1937.

Details
TURING, Alan Mathison (1912-1954). "On Computable Numbers, with an Application to the Entscheidungsproblem." In Proceedings of the London Mathematical Society, Second Series, Vol. 42, pp.230-265. London, 1937.

8o (248 x 174 mm). Later green wrappers, red morocco spine label.

THE FIRST APPEARANCE OF TURING'S CONCEPT OF A THEORETICAL "UNIVERSAL" COMPUTING MACHINE. In this important paper, Turing "analyzed the processes that can be carried out in computing a number to arrive at a concept of a theoretical 'universal' computing machine (the 'Turing machine'), capable of operating upon any 'computable' sequence--that is, any sequence of zeros and ones" (DSB). A FOUNDATIONAL WORK IN THE HISTORY OF COMPUTER TECHNOLOGY. From Gutenberg to the Internet 7.1. OOC 394.

More from Fine Printed Books and Manuscripts including Americana

View All
View All