6 found
Order:
  1.  4
    Gabor T. Herman (1971). Strong Computability and Variants of the Uniform Halting Problem. Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 17 (1):115-131.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  2.  19
    Gabor T. Herman (1969). A Simple Solution of the Uniform Halting Problem. Journal of Symbolic Logic 34 (4):639-640.
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  3.  6
    Gabor T. Herman (1971). Strong Computability and Variants of the Uniform Halting Problem. Mathematical Logic Quarterly 17 (1):115-131.
  4.  8
    Gabor T. Herman (1969). The Unsolvability of the Uniform Halting Problem for Two State Turing Machines. Journal of Symbolic Logic 34 (2):161-165.
  5.  1
    Gabor T. Herman (1971). 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] Journal of Symbolic Logic 36 (3):532-534.
    Direct download  
     
    Export citation  
     
    My bibliography  
  6. Gabor T. Herman (1971). Review: Philip K. Hooper, The Undecidability of the Turing Machine Immortality Problem. [REVIEW] Journal of Symbolic Logic 36 (1):150-150.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography