Basic elements and problems of probability theory
David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
After a brief review of ontic and epistemic descriptions, and of subjective, logical and statistical interpretations of probability, we summarize the traditional axiomatization of calculus of probability in terms of Boolean algebras and its set-theoretical realization in terms of Kolmogorov probability spaces. Since the axioms of mathematical probability theory say nothing about the conceptual meaning of “randomness” one considers probability as property of the generating conditions of a process so that one can relate randomness with predictability (or retrodictability). In the measure-theoretical codification of stochastic processes genuine chance processes can be defined rigorously as so-called regular processes which do not allow a long-term prediction. We stress that stochastic processes are equivalence classes of individual point functions so that they do not refer to individual processes but only to an ensemble of statistically equivalent individual processes. Less popular but conceptually more important than statistical descriptions are individual descriptions which refer to individual chaotic processes. First, we review the individual description based on the generalized harmonic analysis by Norbert Wiener. It allows the definition of individual purely chaotic processes which can be interpreted as trajectories of regular statistical stochastic processes. Another individual description refers to algorithmic procedures which connect the intrinsic randomness of a finite sequence with the complexity of the shortest program necessary to produce the sequence. Finally, we ask why there can be laws of chance. We argue that random events fulfill the laws of chance if and only if they can be reduced to (possibly hidden) deterministic events. This mathematical result may elucidate the fact that not all nonpredictable events can be grasped by the methods of mathematical probability theory.
|Keywords||No keywords specified (fix it)|
No categories specified
(categorize this paper)
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
|Through your library||
References found in this work BETA
No references found.
Citations of this work BETA
No citations found.
Similar books and articles
D. Costantini & U. Garibaldi (2004). The Ehrenfest Fleas: From Model to Theory. Synthese 139 (1):107 - 142.
Theodore Hailperin (2000). Probability Semantics for Quantifier Logic. Journal of Philosophical Logic 29 (2):207-239.
Thierry Magnac & Jean-Marc Robin (1999). Dynamic Stochastic Dominance in Bandit Decision Problems. Theory and Decision 47 (3):267-295.
John L. Pollock (1992). The Theory of Nomic Probability. Synthese 90 (2):263 - 299.
Charlotte Werndl (2009). Are Deterministic Descriptions and Indeterministic Descriptions Observationally Equivalent? Studies in History and Philosophy of Science Part B 40 (3):232-242.
Aidan Lyon (2010). Deterministic Probability: Neither Chance nor Credence. Synthese 182 (3):413-432.
Antony Eagle, Chance Versus Randomness. Stanford Encyclopedia of Philosophy.
H. E. Kyburg Jr (1966). Probability and Decision. Philosophy of Science 33 (3):250-261.
Vieri Benci, Leon Horsten & Sylvia Wenmackers (2013). Non-Archimedean Probability. Milan Journal of Mathematics 81 (1):121-151.
Added to index2009-01-28
Total downloads5 ( #259,745 of 1,679,331 )
Recent downloads (6 months)0
How can I increase my downloads?