( en | de | ru )

 

Disambiguation of "Hartmanis, Juris"

Author of the publication

copydeleteadd this publication to your clipboard
What makes Some Language Theory Problems Undecidable.

, and . J. Comput. Syst. Sci., 4 (4): 368-376 (1970)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Michael Juris

Ilona Hartmanis

Juris Ezernieks

Juris Kronenberg

Juris Irschs

 

Other publications of authors with the same name

Structural Complexity.. Current Trends in Theoretical Computer Science, volume 40 of World Scientific Series in Computer Science, World Scientific, (1993)Further Results on the Structure of Sequential Machines.. J. ACM, 10 (1): 78-88 (1963)The Turing Computational Model., , , , and . ACM-TURING, page 8:1. ACM, (2012)On Isomorphisms and Density of NP and Other Complete Sets, and . STOC, page 30-40. ACM, (1976)Turing Machine-Inspired Computer Science Results.. CiE, volume 7318 of Lecture Notes in Computer Science, page 276-282. Springer, (2012)Containment, Separation, Complete Sets, and Immunity of Complexity Classes., , and . ICALP, volume 226 of Lecture Notes in Computer Science, page 136-145. Springer, (1986)On the Computing Paradigm and Computational Complexity.. MFCS, volume 969 of Lecture Notes in Computer Science, page 82-92. Springer, (1995)Undecidability and Incompleteness Results in Automata Theory.. A Half-Century of Automata Theory, World Scientific, (2000)Complexity Classes without Machines: On Complete Languages for UP., and . Theor. Comput. Sci., (1988)One-Way Functions and the Nonisomorphism of NP-Complete Sets., and . Theor. Comput. Sci., 81 (1): 155-163 (1991)