Subcomputable Schnorr randomness

DOI10.23638/LMCS-13(2:2)2017MaRDI QIDQ2985124zbMATHFDO

Authors Claude Sureson

Publication date 16 May 2017

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

zbMATH Keywords

algorithmic randomnesscomplexity classes of computation

Mathematics Subject Classification ID

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

Recommendations

• Schnorr randomness
• Schnorr randomness
• Schnorr randomness for noncomputable measures
• Sub-computable bounded pseudorandomness
• Sub-computable Boundedness Randomness

Cites work

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

Cited in

(9)

• Sub-computable Boundedness Randomness
• Subquadratic SNARGs in the random oracle model
• Subcomputable Hausdorff function dimension
• Schnorr randomness for noncomputable measures
• Defining a randomness notion via another
• Sub-computable bounded pseudorandomness
• Schnorr randomness
• Subclasses of the weakly random reals
• Schnorr randomness

This page was built for publication: Subcomputable Schnorr randomness

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