Computability versus exact computability of martingales

DOI10.1016/J.IPL.2004.08.008zbMATH Open1168.03338OpenAlexW1972091241MaRDI QIDQ834952FDOQ834952

Authors: Jack H. Lutz 

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

zbMATH Keywords

computational complexitymartingalescomputabilityreal-valued functions

Mathematics Subject Classification ID

Combinatorial probability (60C05) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Constructive and recursive analysis (03F60)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The definition of random sequences
• Zufälligkeit und Wahrscheinlichkeit. Eine algorithmische Begründung der Wahrscheinlichkeitstheorie. (Randomness and probability. An algorithmic foundation of probability theory)
• Weak completeness in \(\text{E}\) and \(\text{E}_{2}\)
• Von Mises' definition of random sequences reconsidered
• Title not available (Why is that?)
• On the definitions of computable real continuous functions
• Computable functionals
• Effective fractal dimensions
• Title not available (Why is that?)

Cited In (1)

• Randomness and lowness notions via open covers

This page was built for publication: Computability versus exact computability of martingales

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q834952)