.Original printed wrappers
by Turing, A[lan] M[athison].
.Original printed wrappers. Small octavo. . Light pencil marking on front cover. Some browning to edges of text leaves.
Very good. A year before his death, Turing summarized his most profound contribution to computer science in this paper, translating the halting problem of automata theory into a problem of deciding whether a player can win a board game from any given initial position. In 1936-37, Turing described the "Turing Machine," an imaginary machine that can solve all problems that are computable; in fact, the definition of "computable" is that the problem can be solved by a Turing Machine. In this paper he shows that the problem of computability is equivalent to the problem of deciding the outcome of a puzzle or a board game with substitutional types of moves. (Inventory #: 17887)
Very good. A year before his death, Turing summarized his most profound contribution to computer science in this paper, translating the halting problem of automata theory into a problem of deciding whether a player can win a board game from any given initial position. In 1936-37, Turing described the "Turing Machine," an imaginary machine that can solve all problems that are computable; in fact, the definition of "computable" is that the problem can be solved by a Turing Machine. In this paper he shows that the problem of computability is equivalent to the problem of deciding the outcome of a puzzle or a board game with substitutional types of moves. (Inventory #: 17887)
(323) 658-1901
