On the computing paradigm and computational complexity
- 926 Downloads
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.
KeywordsTuring Machine Random Oracle Hamiltonian Path Separation Problem Computing Paradigm
Unable to display preview. Download preview PDF.
- 2.Babai, L.: Trading group theory for randomness. ACM Symposium on Theory of Computing, (1985) 421–429Google Scholar
- 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.Deutsch, D.: Quantum theory, the Church-Turing principle and the universal quantum computer. Proc. Roy. Soc. Lond. A400 (1985) 96–117Google Scholar
- 7.Deutsch, D. and Jozsa, R.: Rapid solution of problems by quantum computation. Proc. Roy. Soc. Lond. A39 (1992) 553–558Google Scholar
- 9.Feynman, R.: Quantum mechanical computers. Foundations of Physics 16 (1986) 507–531 (Originally appeared in Optics News, Feb. 1985)Google Scholar
- 10.Fenner, S. and Fortnow, and Kurtz, S.: The isomorphism conjecture holds relative to an oracle. SIAM J. Comp. to appear.Google Scholar
- 11.Fortnow, L. and Sipser, M.: Are there interactive protocols for co-NP languages? Inform. Proc. Lett. 28 (1988) 249–251Google Scholar
- 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.Hopcroft, J. E.: Turing machines. Sci. Amer., (May 1984) 86–98Google Scholar
- 15.Kurtz, S. A.: On the random oracle hypothesis. ACM Symposium on Theory of Computing, 1982. 224–230Google Scholar
- 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.Lipton, Richard J.: DNA Solutions to Hard Computational Problems. Science 262 (April, 1995) 542–545Google Scholar
- 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.Shamir, A.: IP = PSPACE. Journal of the ACM 39 (1992) 869–877Google Scholar
- 20.Siegelman, Hava T.: Computation Beyond the Turing Limit Science 262 (April, 1995) 545–548Google Scholar