9
Alan Turing, “The Word Problem in Semi-Groups,” 1950, First EdAlan Turning (1912-1954) – a
Alan Turning (1912-1954) – a pioneering English computer scientist and asset in WWII
“The Word Problem in Semi-Groups With Cancellation.” Princeton, NJ: Princeton University Press, 1950. First Edition. Annals of Mathematics, Second Series, vol. 52, no. 2, September, 1950, pp. 491-505.
Quatro (250 x 170 mm); red cloth binding with gilt lettering to spine
Very good condition
Estimate: $1,500
In this work from Turing’s post-World War II researches, Turing gives proof that the Halting Problem with word problems is undecidable for semi-groups with cancellation.
Alan Turing (English, 1912-1954)
Turing gained posthumous fame for his work in early computer theory and the practical application of those theories in developing the Colossus computer that broke the German Enigman codes during World War II. His work saved countless lives and was crucial in the alley win. After the war, Turing moved to London and began work for the National Physical Laboratory. There, he led the design for the Automatic Computer Engine and created a groundbreaking blueprint for store-program computers. Turing went on to hold high-ranking positions at the University of Manchester. Tragically, despite saving the lives of so many, Turing’s life ended in 1954. He succumbed to the struggle against the hormonal treatment that he was forced to take by the British Government after being identified as a homosexual in 1952. Following a petition started by John Graham-Cumming, in 2009 the British government posthumously apologized for prosecuting Turing for being a homosexual. Turing has received many posthumous honors, including being the subject of the 2014 biopic, “The Imitation Game,” staring Benedict Cumberbatch.
Condition
This is an ex-library edition in library binding with bookplate, ink stamp on the fore edge, and label on the spine. In overall very good condition.
Shipping costs excl. statutory VAT and plus 2,5% (+VAT) shipping insurance.
Alan Turning (1912-1954) – a pioneering English computer scientist and asset in WWII
“The Word Problem in Semi-Groups With Cancellation.” Princeton, NJ: Princeton University Press, 1950. First Edition. Annals of Mathematics, Second Series, vol. 52, no. 2, September, 1950, pp. 491-505.
Quatro (250 x 170 mm); red cloth binding with gilt lettering to spine
Very good condition
Estimate: $1,500
In this work from Turing’s post-World War II researches, Turing gives proof that the Halting Problem with word problems is undecidable for semi-groups with cancellation.
Alan Turing (English, 1912-1954)
Turing gained posthumous fame for his work in early computer theory and the practical application of those theories in developing the Colossus computer that broke the German Enigman codes during World War II. His work saved countless lives and was crucial in the alley win. After the war, Turing moved to London and began work for the National Physical Laboratory. There, he led the design for the Automatic Computer Engine and created a groundbreaking blueprint for store-program computers. Turing went on to hold high-ranking positions at the University of Manchester. Tragically, despite saving the lives of so many, Turing’s life ended in 1954. He succumbed to the struggle against the hormonal treatment that he was forced to take by the British Government after being identified as a homosexual in 1952. Following a petition started by John Graham-Cumming, in 2009 the British government posthumously apologized for prosecuting Turing for being a homosexual. Turing has received many posthumous honors, including being the subject of the 2014 biopic, “The Imitation Game,” staring Benedict Cumberbatch.
Condition
This is an ex-library edition in library binding with
Alan Turning (1912-1954) – a pioneering English computer scientist and asset in WWII
“The Word Problem in Semi-Groups With Cancellation.” Princeton, NJ: Princeton University Press, 1950. First Edition. Annals of Mathematics, Second Series, vol. 52, no. 2, September, 1950, pp. 491-505.
Quatro (250 x 170 mm); red cloth binding with gilt lettering to spine
Very good condition
Estimate: $1,500
In this work from Turing’s post-World War II researches, Turing gives proof that the Halting Problem with word problems is undecidable for semi-groups with cancellation.
Alan Turing (English, 1912-1954)
Turing gained posthumous fame for his work in early computer theory and the practical application of those theories in developing the Colossus computer that broke the German Enigman codes during World War II. His work saved countless lives and was crucial in the alley win. After the war, Turing moved to London and began work for the National Physical Laboratory. There, he led the design for the Automatic Computer Engine and created a groundbreaking blueprint for store-program computers. Turing went on to hold high-ranking positions at the University of Manchester. Tragically, despite saving the lives of so many, Turing’s life ended in 1954. He succumbed to the struggle against the hormonal treatment that he was forced to take by the British Government after being identified as a homosexual in 1952. Following a petition started by John Graham-Cumming, in 2009 the British government posthumously apologized for prosecuting Turing for being a homosexual. Turing has received many posthumous honors, including being the subject of the 2014 biopic, “The Imitation Game,” staring Benedict Cumberbatch.
Condition
This is an ex-library edition in library binding with bookplate, ink stamp on the fore edge, and label on the spine. In overall very good condition.
Shipping costs excl. statutory VAT and plus 2,5% (+VAT) shipping insurance.
Alan Turning (1912-1954) – a pioneering English computer scientist and asset in WWII
“The Word Problem in Semi-Groups With Cancellation.” Princeton, NJ: Princeton University Press, 1950. First Edition. Annals of Mathematics, Second Series, vol. 52, no. 2, September, 1950, pp. 491-505.
Quatro (250 x 170 mm); red cloth binding with gilt lettering to spine
Very good condition
Estimate: $1,500
In this work from Turing’s post-World War II researches, Turing gives proof that the Halting Problem with word problems is undecidable for semi-groups with cancellation.
Alan Turing (English, 1912-1954)
Turing gained posthumous fame for his work in early computer theory and the practical application of those theories in developing the Colossus computer that broke the German Enigman codes during World War II. His work saved countless lives and was crucial in the alley win. After the war, Turing moved to London and began work for the National Physical Laboratory. There, he led the design for the Automatic Computer Engine and created a groundbreaking blueprint for store-program computers. Turing went on to hold high-ranking positions at the University of Manchester. Tragically, despite saving the lives of so many, Turing’s life ended in 1954. He succumbed to the struggle against the hormonal treatment that he was forced to take by the British Government after being identified as a homosexual in 1952. Following a petition started by John Graham-Cumming, in 2009 the British government posthumously apologized for prosecuting Turing for being a homosexual. Turing has received many posthumous honors, including being the subject of the 2014 biopic, “The Imitation Game,” staring Benedict Cumberbatch.
Condition
This is an ex-library edition in library binding with
Rare & Exceptional Books
Sale Date(s)
Venue Address
For auctionata U.S. delivery information please telephone +1 212.899.1774.
Important Information
25.00 % buyer's premium on the hammer price, VAT included
20.00 % buyer's premium on hammer price over 1,000,000 USD
15.00 % buyer's premium on hammer price over 2,000,000 USD