Three problems in computer science

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Three problems in computer science

Full text

Pdf (25 KB)

Source

Journal of the ACM (JACM) archive
Volume 50 , Issue 1 (January 2003) table of contents

Pages: 96 - 99

Year of Publication: 2003

ISSN:0004-5411

Author

Leslie G. Valiant

Harvard University

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 7, Downloads (12 Months): 122, Citation Count: 5

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/602382.602410 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Ethan Bernstein , Umesh Vazirani, Quantum Complexity Theory, SIAM Journal on Computing, v.26 n.5, p.1411-1473, Oct. 1997 [doi>10.1137/S0097539796300921]
	2	Carnap, R. 1950. Logical Foundations of Probability. University of Chicago Press, Chicago, Ill.
	3	Stephen A. Cook, The complexity of theorem-proving procedures, Proceedings of the third annual ACM symposium on Theory of computing, p.151-158, May 03-05, 1971, Shaker Heights, Ohio, United States [doi>10.1145/800157.805047]
	4	Joseph Y. Halpern, An analysis of first-order logics of probability, Artificial Intelligence, v.46 n.3, p.311-350, Dec. 1990 [doi>10.1016/0004-3702(90)90019-V]
	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.
	6	Levin, L. A. 1973. Universal sorting problems. Prob. Inf. Trans., 9, 265--266.
	7	McCarthy, J. 1959. Programs with commonsense. In Teddington conference on the Mechanization of Thought Processes. HMSO, London, England.
	8	Papadimitriou, C. H. 1994. Computational Complexity. Addison-Wesley, Reading, Mass.
	9	Judea Pearl, Probabilistic reasoning in intelligent systems: networks of plausible inference, Morgan Kaufmann Publishers Inc., San Francisco, CA, 1988
	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.
	11	Leslie G. Valiant, Circuits of the mind, Oxford University Press, Inc., New York, NY, 1994
	12	Leslie G. Valiant, Robust logics, Artificial Intelligence, v.117 n.2, p.231-253, March 2000 [doi>10.1016/S0004-3702(00)00002-3]

CITED BY 5

	Artur S. d'Avila Garcez , Luís C. Lamb, A connectionist computational model for epistemic and temporal reasoning, Neural Computation, v.18 n.7, p.1711-1738, July 2006
	Artur S. d'Avila Garcez , Luís C. Lamb , Dov M. Gabbay, Connectionist computations of intuitionistic reasoning, Theoretical Computer Science, v.358 n.1, p.34-55, 31 July 2006
	Artur S. dAvila Garcez , Luís C. Lamb , Dov M. Gabbay, Connectionist modal logic: Representing modalities in neural networks, Theoretical Computer Science, v.371 n.1-2, p.34-53, February, 2007
	Luís C. Lamb , Rafael V. Borges , Artur S. d'Avila Garcez, A connectionist cognitive model for temporal synchronisation and learning, Proceedings of the 22nd national conference on Artificial intelligence, p.827-832, July 22-26, 2007, Vancouver, British Columbia, Canada
	Artur S. d'Avila Garcez , Dov M. Gabbay, Fibring neural networks, Proceedings of the 19th national conference on Artifical intelligence, p.342-347, July 25-29, 2004, San Jose, California