scientific article

DOI10.23638/LMCS-13(2:2)2017zbMath1448.03032arXiv1608.08918MaRDI QIDQ2985124

Claude Sureson

Publication date: 16 May 2017

Full work available at URL: https://arxiv.org/abs/1608.08918

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

algorithmic randomnesscomplexity classes of computation

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Algorithmic randomness and dimension (03D32)

Related Items (1)

Subcomputable Hausdorff function dimension

Cites Work

• Unnamed Item
• Unnamed Item
• A separation of two randomness concepts
• Weak completeness in \(\text{E}\) and \(\text{E}_{2}\)
• On the notion of infinite pseudorandom sequences
• Almost everywhere high nonuniform complexity
• Zufälligkeit und Wahrscheinlichkeit. Eine algorithmische Begründung der Wahrscheinlichkeitstheorie. (Randomness and probability. An algorithmic foundation of probability theory)
• Sub-computable Boundedness Randomness
• A Theory of Program Size Formally Identical to Information Theory
• Primitive recursive real numbers
• A unified approach to the definition of random sequences
• The definition of random sequences

This page was built for publication: