skip to main content
article

Three problems in computer science

Published:01 January 2003Publication History
First page image

References

  1. Bernstein, E., and Vazirani, U. V. 1997. Quantum complexity theory, SIAM J. Comput., 1411--1473. Google ScholarGoogle Scholar
  2. Carnap, R. 1950. Logical Foundations of Probability. University of Chicago Press, Chicago, Ill.Google ScholarGoogle Scholar
  3. Cook, S. A. 1971. The complexity of theorem proving procedures. In Proceedings of the 3rd ACM symposium on Theory of computing. ACM, New York, 151--158. Google ScholarGoogle Scholar
  4. Halpern, J. Y. 1990. An analysis of first-order logics of probability. Artif. Int., 46, 311--350. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Karp, R. M. 1972. Reducibility among combinatorial problems. In Complexity of computer computations. R. E. Miller and J. W. Thatcher, Eds. Plenum Press, New York, 85--103.Google ScholarGoogle Scholar
  6. Levin, L. A. 1973. Universal sorting problems. Prob. Inf. Trans., 9, 265--266.Google ScholarGoogle Scholar
  7. McCarthy, J. 1959. Programs with commonsense. In Teddington conference on the Mechanization of Thought Processes. HMSO, London, England.Google ScholarGoogle Scholar
  8. Papadimitriou, C. H. 1994. Computational Complexity. Addison-Wesley, Reading, Mass.Google ScholarGoogle Scholar
  9. Pearl, J. 1988. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan-Kaufmann, Los Altos, Calif. Google ScholarGoogle Scholar
  10. Turing, A. M. 1936. On computable numbers, with an application to the Entscheidungsproblem. Proc. Lond. Math. Soc. 42, 230--265. Also 43, (1937), 544--546.Google ScholarGoogle Scholar
  11. Valiant, L. G. 1994. Circuits of the Mind. Oxford University Press, New York. Google ScholarGoogle Scholar
  12. Valiant, L. G. 2000. Robust logics. Artif. Int., 117, 231--253. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Three problems in computer science

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in

        Full Access

        • Published in

          cover image Journal of the ACM
          Journal of the ACM  Volume 50, Issue 1
          January 2003
          100 pages
          ISSN:0004-5411
          EISSN:1557-735X
          DOI:10.1145/602382
          Issue’s Table of Contents

          Copyright © 2003 ACM

          Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 1 January 2003
          Published in jacm Volume 50, Issue 1

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • article

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader