Martingales in the Study of Randomness
From MaRDI portal
Publication:6096241
DOI10.1007/978-3-031-05988-9_11zbMath1523.60003MaRDI QIDQ6096241
Laurent Bienvenu, Alexander Shen, Glenn R. Shafer
Publication date: 11 September 2023
Published in: The Splendors and Miseries of Martingales (Search for Journal in Brave)
Martingales with discrete parameter (60G42) History of mathematics in the 20th century (01A60) Martingales with continuous parameter (60G44) History of probability theory (60-03)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A separation of two randomness concepts
- Process complexity and effective random tests
- The sources of Kolmogorov's \textit{Grundbegriffe}
- Probability in 1919/20: the von Mises-Pólya-controversy
- Zufälligkeit und Wahrscheinlichkeit. Eine algorithmische Begründung der Wahrscheinlichkeitstheorie. (Randomness and probability. An algorithmic foundation of probability theory)
- Paul Lévy and Maurice Fréchet. 50 years of correspondence in 107 letters. Translations of the introductory sections and most of the notes by Peter Kleban
- Note on probability
- Probability and Finance
- Algorithmic Randomness and Complexity
- Algorithmic Information Theory and Foundations of Probability
- Von Mises' definition of random sequences reconsidered
- Some Properties of Kolmogorov $\Delta$-Random Finite Sequences
- A Theory of Program Size Formally Identical to Information Theory
- Complexity-based induction systems: Comparisons and convergence theorems
- Dimension in Complexity Classes
- Kolmogorov Complexity and Algorithmic Randomness
- Game‐Theoretic Foundations for Probability and Finance
- Mathematicians Forced to Philosophize: An Introduction to Khinchin's Paper on von Mises' Theory of Probability
- Felix Hausdorff Gesammelte Werke
- On the Length of Programs for Computing Finite Binary Sequences
- NORMAL ALGORITHMS CONNECTED WITH THE COMPUTATION OF BOOLEAN FUNCTIONS
- Logical basis for information theory and probability theory
- On the Length of Programs for Computing Finite Binary Sequences
- The Literature on von Mises' Kollektivs Revisited
- Complexity oscillations in infinite binary sequences
- THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
- A unified approach to the definition of random sequences
- The definition of random sequences
- A formal theory of inductive inference. Part I
- A formal theory of inductive inference. Part II
- PROBABILITÉ ET CERTITUDE
- Abraham Wald, 1902-1950
- Abraham Wald, 1902-1950
- The Formative Years of Abraham Wald and His Work in Geometry
- An introduction to Kolmogorov complexity and its applications
This page was built for publication: Martingales in the Study of Randomness
