Demuth’s Path to Randomness

DOI10.1007/978-3-642-27654-5_12zbMath1353.03047OpenAlexW1691126109MaRDI QIDQ2891309

André Nies, Antonín Kučera

Publication date: 15 June 2012

Published in: Computation, Physics and Beyond (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-27654-5_12

Mathematics Subject Classification ID

History of mathematics in the 20th century (01A60) Constructive and recursive analysis (03F60) History of mathematical logic and foundations (03-03) Algorithmic randomness and dimension (03D32) Computation over the reals, computable analysis (03D78)

Related Items (1)

Randomness and differentiability

Cites Work

• Computably enumerable sets below random sets
• Demuth randomness and computational complexity
• Some analysis without covering theorems
• Denjoy-Young-Saks theorem for approximate derivatives revisited
• Zufälligkeit und Wahrscheinlichkeit. Eine algorithmische Begründung der Wahrscheinlichkeitstheorie. (Randomness and probability. An algorithmic foundation of probability theory)
• CHARACTERIZING LOWNESS FOR DEMUTH RANDOMNESS
• Difference randomness
• Notions of weak genericity
• Randomness and differentiability
• Computability and Randomness
• The Degrees of Hyperimmune Sets
• The definition of random sequences
• Randomness, relativization and Turing degrees
• 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

This page was built for publication: Demuth’s Path to Randomness