Laplace's demon consults an oracle: The computational complexity of prediction
Studies in History and Philosophy of Science Part B 27 (2):161-180 (1996)
| Abstract | This article has no associated abstract. (fix it) | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,709 |
| External links |
 |
| Through your library | Configure |
Similar books and articlesJakub Szymanik (2010). Computational Complexity of Polyadic Lifts of Generalized Quantifiers in Natural Language. Linguistics and Philosophy 33 (3):215-250.
Gregory J. Chaitin (1970). Computational Complexity and Godel's Incompleteness Theorem. [Rio De Janeiro,Centro Técnico Científico, Pontifícia Universidade Católica Do Rio De Janeiro.
Jakub Szymanik (2009). The Computational Complexity of Quantified Reciprocals. In Peter Bosch, David Gabelaia & Jérôme Lang (eds.), Lecture Notes on Artificial Intelligence 5422, Logic, Language, and Computation 7th International Tbilisi Symposium on Logic, Language, and Computation. Springer.
Steven Weinstein (2003). Objectivity, Information, and Maxwell's Demon. Philosophy of Science 70 (5):1245-1255.
Steven Weinstein (2003). Objectivity, Information, and Maxwell's Demon. Philosophy of Science 70 (5):1245-1255.
Richard Green (1995). The Thwarting of Laplace's Demon: Arguments Against the Mechanistic World-View. St. Martin's Press.
Richard Laing (1974). Maxwell's Demon and Computation. Philosophy of Science 41 (2):171-178.
Analytics
Monthly downloads |
Added to index2009-01-28Total downloads16 ( #74,784 of 549,699 )Recent downloads (6 months)2 ( #37,450 of 549,699 )How can I increase my downloads? |
My notes
Discussion
