A Characterization of Constructive Dimension

DOI10.1016/j.entcs.2008.03.025zbMath1262.03144MaRDI QIDQ4918047

Satyadev Nandakumar

Publication date: 3 May 2013

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2008.03.025

zbMATH Keywords

martingale; algorithmic randomness; constructive dimension; measures of impossibility; s-gale

Mathematics Subject Classification ID

03F60: Constructive and recursive analysis

60G48: Generalizations of martingales

54F45: Dimension theory in general topology

03D32: Algorithmic randomness and dimension

Cites Work

• Entropy, Hausdorff measures old and new, and limit sets of geometrically finite Kleinian groups
• Almost everywhere high nonuniform complexity
• Ergodic theorems for individual random sequences
• The dimensions of individual strings and sequences
• Zufälligkeit und Wahrscheinlichkeit. Eine algorithmische Begründung der Wahrscheinlichkeitstheorie. (Randomness and probability. An algorithmic foundation of probability theory)
• Algorithmic Randomness and Complexity
• Algorithms and Randomness
• Two definitions of fractional dimension
• STACS 2004
• [https://portal.mardi4nfdi.de/wiki/Publication:5587565 Klassifikation der Zufallsgesetze nach Komplexit�t und Ordnung]
• A unified approach to the definition of random sequences
• The definition of random sequences
• Unnamed Item
• Unnamed Item