On the computing paradigm and computational complexity

  • Juris Hartmanis
Invited Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 969)


Computational complexity theory is the study of the quantitative laws that govern computing. Since the computing paradigm is universal and pervasive, the quantitative laws of computational complexity apply to all information processing from numerical computations and simulation to logical reasoning and formal theorem proving, as well as processes of rational reasoning.

In this view, the search for what is and is not feasibly computable takes on an even deeper significance than just a central problem in theoretical computer science. The search for the limits of what is feasibly computable is the search for the limits of scientific theories and, possibly, rational reasoning.


Turing Machine Random Oracle Hamiltonian Path Separation Problem Computing Paradigm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Adleman, Leonard M.: Molecular Computation of Solutions of Combinatorial Problems. Science 266 (Nov. 1994) 1021–1024PubMedGoogle Scholar
  2. 2.
    Babai, L.: Trading group theory for randomness. ACM Symposium on Theory of Computing, (1985) 421–429Google Scholar
  3. 3.
    Berman, L. and Hartmanis, J.: On isomorphism and density of NP and other complete sets. SIAM Journal on Computing 6 (1977) 305–322CrossRefGoogle Scholar
  4. 4.
    Bennett, C. and J. Gill: Relative to a Random Oracle A, P ANP Aco-NP A with probability 1. SIAM J. Comput. 10 No. 1 (1981) 96–113CrossRefGoogle Scholar
  5. 5.
    Chang, Richard, Benny Chor, Oded Goldreich, Juris Hartmanis, Johan Hastad, Desh Ranjan and Pankaj Rohatgi: The Random Oracle Hypothesis is False. J. Computer and System Sciences 49 (August 1994) 24–39Google Scholar
  6. 6.
    Deutsch, D.: Quantum theory, the Church-Turing principle and the universal quantum computer. Proc. Roy. Soc. Lond. A400 (1985) 96–117Google Scholar
  7. 7.
    Deutsch, D. and Jozsa, R.: Rapid solution of problems by quantum computation. Proc. Roy. Soc. Lond. A39 (1992) 553–558Google Scholar
  8. 8.
    Feymnan, R.: Simulating physics with computers. International Journal of Theoretical Physics 21 No. 6/7 (1982) 467–488MathSciNetGoogle Scholar
  9. 9.
    Feynman, R.: Quantum mechanical computers. Foundations of Physics 16 (1986) 507–531 (Originally appeared in Optics News, Feb. 1985)Google Scholar
  10. 10.
    Fenner, S. and Fortnow, and Kurtz, S.: The isomorphism conjecture holds relative to an oracle. SIAM J. Comp. to appear.Google Scholar
  11. 11.
    Fortnow, L. and Sipser, M.: Are there interactive protocols for co-NP languages? Inform. Proc. Lett. 28 (1988) 249–251Google Scholar
  12. 12.
    Goldwasser, S. Micali, S. and Rackoff, C.: The knowledge complexity of interactive proof systems. SIAM J. Comput. 18 No. 1 (1989) 186–208CrossRefGoogle Scholar
  13. 13.
    Hartmanis, J.: Structural Complexity Column: “On the Importance of Being II 2 Hard. Bulletin of the European Association of Theoretical Computer Science (EATCS) 37 (Feb. 1989) 117–127Google Scholar
  14. 14.
    Hopcroft, J. E.: Turing machines. Sci. Amer., (May 1984) 86–98Google Scholar
  15. 15.
    Kurtz, S. A.: On the random oracle hypothesis. ACM Symposium on Theory of Computing, 1982. 224–230Google Scholar
  16. 16.
    Kurtz, S.A. with Mahaney, S.R. and Royer, J.S.: The isomorphism conjecture fails relative to a random oracle. ACM Symposium on Theory of Computing, 1989. 157–166Google Scholar
  17. 17.
    Lipton, Richard J.: DNA Solutions to Hard Computational Problems. Science 262 (April, 1995) 542–545Google Scholar
  18. 18.
    Schor, Peter W.: Algorithms for Quantum Computation: Discrete Logarithms and Factoring. “Proceedings 35th Annual Symposium on Foundations of Computer Science.” (Nov. 1994)Google Scholar
  19. 19.
    Shamir, A.: IP = PSPACE. Journal of the ACM 39 (1992) 869–877Google Scholar
  20. 20.
    Siegelman, Hava T.: Computation Beyond the Turing Limit Science 262 (April, 1995) 545–548Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Juris Hartmanis
    • 1
  1. 1.Department of Computer ScienceCornell UniversityIthacaUSA

Personalised recommendations