Computability versus exact computability of martingales
From MaRDI portal
Publication:834952
DOI10.1016/j.ipl.2004.08.008zbMath1168.03338OpenAlexW1972091241MaRDI QIDQ834952
Publication date: 27 August 2009
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2004.08.008
Constructive and recursive analysis (03F60) Combinatorial probability (60C05) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Weak completeness in \(\text{E}\) and \(\text{E}_{2}\)
- Zufälligkeit und Wahrscheinlichkeit. Eine algorithmische Begründung der Wahrscheinlichkeitstheorie. (Randomness and probability. An algorithmic foundation of probability theory)
- Effective fractal dimensions
- Computable functionals
- On the definitions of computable real continuous functions
- Von Mises' definition of random sequences reconsidered
- The definition of random sequences