viaLibri Requires Cookies CLICK HERE TO HIDE THIS NOTICE

Recently found by viaLibri....

The Word Problem in Semi-Groups With Cancellation - Turing, Alan M - 1950. [1215001]
Princeton University Press, Princeton, NJ 1950 - Alan Turing's (1912-1954) last paper. Turing gained posthumous fame for his work in early computer theory and the practical application of those theories in the development of the Colossus computer that was responsible for the breaking the German Enigma codes during World War II. After the War, Turing began to contemplate his earlier paper, "On Computable Numbers, with an Application to the Entscheidungsproblem," (Proceedings of the London Mathematical Society, 2 (1937) 42 (1)) and his conclusion that the halting problem is unsolvable.The Halting Problem is the problem in knowing if a machine programmed to solve a problem will finish running or continue running forever. Turing began to wonder if that same hypothesis word transfer to word groups--undoubtedly influenced by his work on the Enigma code breaking project at Bletchley Park during the War. This paper is Turing's conclusion that, in fact, his earlier paper was correct and that theory of the Halting Problem was also unsolvable with word problems.Turing was back in the news with the November 2014 biopic, "The Imitation Game" with Benedict Cumberbatch as Alan Turing. Annals of Mathematics, Second Series, Vol. 52, No. 2, September 1950. pp. 491-505. 4to. Ex-Library. Red cloth library binding with gold embossed titling to spine, call number pasted at base, library stamp at head and foredge of text block. Library bookplate on front pastedown, card pocket at rear. Very clean within. [Attributes: First Edition; Hard Cover]
      [Bookseller: Artisan Books & Bindery, ABAA/ILAB]
Last Found On: 2016-09-30           Check availability:      AbeBooks    


Browse more rare books from the year 1950

      Home     Wants Manager     Library Search     562 Years   Links     Contact      Search Help      Terms of Service     

Copyright © 2016 viaLibri™ Limited. All rights reserved.