6 found
Order:
  1.  18
    Philip K. Hooper. The Undecidability of the Turing Machine Immortality Problem. The Journal of Symbolic Logic, Vol. 31 , Pp. 219–234. [REVIEW]Gabor T. Herman - 1971 - Journal of Symbolic Logic 36 (1):150-150.
  2.  15
    Patrick C. Fischer. On Formalisms for Turing Machines. Journal of the Association for Computing Machinery, Vol. 12 , Pp. 570–580. - Stål Aanderaa and Patrick C. Fischer. The Solvability of the Halting Problem for 2-State Post Machines. Journal of the Association for Computing Machinery, Vol. 14 , Pp. 677–682. - Patrick C. Fischer. Quantificational Variants on the Halting Problem for Turing Machines. Zeitschrift Für Mathematische Logik Und Grundlagen der Mathematik, Vol. 15 , Pp. 211–218. [REVIEW]Gabor T. Herman - 1971 - Journal of Symbolic Logic 36 (3):532-534.
  3.  38
    A Simple Solution of the Uniform Halting Problem.Gabor T. Herman - 1969 - Journal of Symbolic Logic 34 (4):639-640.
  4.  24
    Strong Computability and Variants of the Uniform Halting Problem.Gabor T. Herman - 1971 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 17 (1):115-131.
  5.  27
    The Unsolvability of the Uniform Halting Problem for Two State Turing Machines.Gabor T. Herman - 1969 - Journal of Symbolic Logic 34 (2):161-165.
  6.  19
    Strong Computability and Variants of the Uniform Halting Problem.Gabor T. Herman - 1971 - Mathematical Logic Quarterly 17 (1):115-131.