Randomness versus superspeedability

DOI10.4230/LIPICS.MFCS.2024.62MaRDI QIDQ7241069zbMATH OpenFDO

Authors Rupert Hölzl, Wolfgang Merkle, Frank Stephan

Publication date 12 May 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.MFCS.2024.62

zbMATH Keywords

left-computable numbersregainingly approximable numbersregular numbersspeedable numberssuperspeedable numbers

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A theorem on hyperhypersimple sets
• Algorithmic randomness and complexity.
• An introduction to Kolmogorov complexity and its applications
• Classical recursion theory. The theory of functions and sets of natural numbers.
• Cohesive sets and recursively enumerable Dedekind cuts
• Computability and randomness
• Genericity of weakly computable objects
• scientific article; zbMATH DE number 1911266 (Why is no real title available?)
• Regainingly approximable numbers and sets
• Regular reals
• Schnorr randomness
• Schnorr trivial sets and truth-table reducibility
• Speedable Left-c.e. Numbers
• The definition of random sequences
• Weihrauch Complexity in Computable Analysis
• Zufälligkeit und Wahrscheinlichkeit. Eine algorithmische Begründung der Wahrscheinlichkeitstheorie. (Randomness and probability. An algorithmic foundation of probability theory)

Cited in

(1)

• Speedability of computably approximable reals and their approximations

This page was built for publication: Randomness versus superspeedability

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