General random sequences and learnable sequences

DOI10.2307/2272862zbMATH Open0376.02026OpenAlexW1996707648MaRDI QIDQ4154541FDOQ4154541

Claus Peter Schnorr, P. H. Fuchs

Publication date: 1978

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2272862

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Axioms; other general questions in probability (60A05) Recursive functions and relations, subrecursive hierarchies (03D20)

Cites Work

• Process complexity and effective random tests
• A unified approach to the definition of random sequences
• A Machine-Independent Theory of the Complexity of Recursive Functions
• On Effective Procedures for Speeding Up Algorithms
• Eine Bemerkung zum Begriff der zuf�lligen Folge

Cited In (9)

• On the inference of optimal descriptions
• Continuous randomness via transformations of 2-random sequences
• On the notion of infinite pseudorandom sequences
• Research in the theory of inductive inference by GDR mathematicians - A survey
• Strong reductions in effective randomness
• An almost machine-independent theory of program-length complexity, sophistication, and induction
• Randomness extraction in computability theory
• Schnorr randomness for noncomputable measures
• Computable randomness and betting for computable probability spaces

This page was built for publication: General random sequences and learnable sequences

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