Recursive unsolvability of Post's problem of "tag" and other topics in theory of Turing machines. Offprint. Pres. copy

Minsky, Marvin

Data di pubblicazione: 1961

Riguardo questo articolo

Minsky, Marvin (1927-2016). Recursive unsolvability of Post s problem of "tag" and other topics in theory of Turing machines. Offprint from Annals of Mathematics 74 (1961). 437-455pp. 254 x 178 mm. Original printed wrappers, light soiling and creasing. Very good. Presentation Copy, inscribed by Minsky to Martin Davis (1928-2023) on the front wrapper: "To Martin Davis with gratitude Marvin Minsky." First Edition, Offprint Issue. Minsky proved in this paper that the deterministic models of computation known as "tag systems," introduced by Emil Post in 1943, are recursively unsolvable. The problem had been suggested to Minsky by mathematical logician Martin Davis, recipient of the present copy, who was then preparing a collected edition of Post s papers on unsolvable problems and computable functions; Minsky acknowledged Davis s contribution on p. 438. .

Codice articolo 51664

Dati bibliografici

• Titolo: Recursive unsolvability of Post's problem of "tag" and other topics in theory of Turing machines. Offprint. Pres. copy
• Data di pubblicazione: 1961
• Rilegatura: Brossura
• Edizione: prima edizione
• Firmato: Autografato dall'autore