.jpg?w=1)
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, parts 3-4, pp.230-265. London, 1937.
2 parts, 8o (253 x 171 mm). Contemporary plain green wrappers (some very minor fading at edges).
THE FIRST APPEARANCE OF TURING'S CONCEPT OF A THEORETICAL "UNIVERSAL" COMPUTING MACHINE. Comprises sheets of the third and fourth quarterly parts for 1937 (containing Turing's paper), but bound in plain contemporary wrappers (the quarterly issues were issued in printed wrappers). The pagination and quire division correspond to the quarterly issues, suggesting that these sheets may possibly have been overrun sheets intended for binding as an annual volume.
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 FOUNDATION WORK IN THE HISTORY OF COMPUTER TECHNOLOGY.
2 parts, 8
THE FIRST APPEARANCE OF TURING'S CONCEPT OF A THEORETICAL "UNIVERSAL" COMPUTING MACHINE. Comprises sheets of the third and fourth quarterly parts for 1937 (containing Turing's paper), but bound in plain contemporary wrappers (the quarterly issues were issued in printed wrappers). The pagination and quire division correspond to the quarterly issues, suggesting that these sheets may possibly have been overrun sheets intended for binding as an annual volume.
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 FOUNDATION WORK IN THE HISTORY OF COMPUTER TECHNOLOGY.