Review: Patrick C. Fischer, On Formalisms for Turing Machines; Stal Aanderaa, Patrick C. Fischer, The Solvability of the Halting Problem for 2-State Post Machines; Patrick C. Fischer, Quantificational Variants on the Halting Problem for Turing Machines
Herman, Gabor T.
J. Symbolic Logic, Tome 36 (1971) no. 1, p. 532-534 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
Publié le : 1971-09-14
Classification:  
@article{1183737791,
     author = {Herman, Gabor T.},
     title = {Review: Patrick C. Fischer, On Formalisms for Turing Machines; Stal Aanderaa, Patrick C. Fischer, The Solvability of the Halting Problem for 2-State Post Machines; Patrick C. Fischer, Quantificational Variants on the Halting Problem for Turing Machines},
     journal = {J. Symbolic Logic},
     volume = {36},
     number = {1},
     year = {1971},
     pages = { 532-534},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1183737791}
}

Herman, Gabor T. Review: Patrick C. Fischer, On Formalisms for Turing Machines; Stal Aanderaa, Patrick C. Fischer, The Solvability of the Halting Problem for 2-State Post Machines; Patrick C. Fischer, Quantificational Variants on the Halting Problem for Turing Machines. J. Symbolic Logic, Tome 36 (1971) no. 1, pp.  532-534. http://gdmltest.u-ga.fr/item/1183737791/