Advertisement

Logic, Randomness and Cognition

  • Michel de Rougemont
Part of the Logic, Epistemology, and the Unity of Science book series (LEUS, volume 2)

Abstract

Many natural intensional properties in artificial and natural languages are hard to compute. We show that randomized algorithms are often necessary to have good estimators of natural properties and to verify some specific relations. We concentrate on the reliability of queries to show the advantage of randomized algorithms in uncertain cognitive worlds.

Keywords

Polynomial Time Edge Label Denotational Semantic Interactive Protocol Interactive Proof 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Babai L. (1985). Trading Group Theory for Randomness. Symposium on the Theory of Computing, 421–429.Google Scholar
  2. Burago D. and de Rougemont M. (1998). “On the Average Complexity of Graph Reliability”. Fundamenta Informaticae 36(4):307–315.Google Scholar
  3. Burago D., de Rougemont M. and Slissenko A (1996). “On the Complexity of Partially Observed Markov Decision Processes”. Theoretical Computer Science, (157):161–183.Google Scholar
  4. Couveignes J.M., Diaz-Frias J.F., de Rougemont M. and Santha M (1994). “On the Interactive Complexity of Graph Reliability”. FSTCS International Symposium on Theoretical Computer Science, Madras, LNCS 880:1–14.Google Scholar
  5. de Rougemont M. (1995). The Reliability of Queries. ACM Principles on Databases Systems, 286–191.Google Scholar
  6. de Rougemont M. and Schlieder C. (1997). Spatial Navigation with Uncertain Deviations. American Association for Artificial Intelligence.Google Scholar
  7. Goldwasser S., Micali S. and Rackoff C. (1985). The Knowledge Complexity of Interactive Poof Systems. Symposium on the Theory of Computing, 291–304.Google Scholar
  8. Lassaigne R. & de Rougemont M. (1996). Logique et complexité. Hermès.Google Scholar
  9. Levin L. (1973). “Universal Sorting Problems”. Problems of Information Transmission 9(3):265–266.Google Scholar
  10. Papadimitriou C. (1985). “Games Against Nature”. Journal of Computer and System Sciences 31:288–301.Google Scholar
  11. Papadimitriou C. (1994). Computational Complexity. Addison-Wesley.Google Scholar
  12. Sinclair A. (1993). Algorithms for Random Generation and Counting. Birhauser Verlag.Google Scholar
  13. Valiant L. (1979). “The Complexity of Enumeration and Reliability Problems”. SIAM Journal of Computing 8(3).Google Scholar

Copyright information

© Springer 2005

Authors and Affiliations

  • Michel de Rougemont
    • 1
  1. 1.Université Paris-IIParis

Personalised recommendations