7 found
Order:
  1.  17
    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.
  2.  19
    A Simple Solution of the Uniform Halting Problem.Gabor T. Herman - 1969 - Journal of Symbolic Logic 34 (4):639-640.
  3.  10
    Strong Computability and Variants of the Uniform Halting Problem.Gabor T. Herman - 1971 - Mathematical Logic Quarterly 17 (1):115-131.
  4.  8
    The Unsolvability of the Uniform Halting Problem for Two State Turing Machines.Gabor T. Herman - 1969 - Journal of Symbolic Logic 34 (2):161-165.
  5.  1
    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. [REVIEW]Gabor T. Herman - 1971 - Journal of Symbolic Logic 36 (3):532-534.
    Direct download  
     
    Export citation  
     
    My bibliography  
  6. Fischer Patrick C.. On Formalisms for Turing Machines. Journal of the Association for Computing Machinery, Vol. 12 , Pp. 570–580.Aanderaa Stål and Fischer Patrick C.. The Solvability of the Halting Problem for 2-State Post Machines. Journal of the Association for Computing Machinery, Vol. 14 , Pp. 677–682.Fischer Patrick C.. 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.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  7. Review: Philip K. Hooper, The Undecidability of the Turing Machine Immortality Problem. [REVIEW]Gabor T. Herman - 1971 - Journal of Symbolic Logic 36 (1):150-150.
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography