General random sequences and learnable sequences

DOI10.2307/2272862MaRDI QIDQ4154541zbMATH OpenOpenAlexFDO

Authors P. H. Fuchs, Claus Peter Schnorr

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

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

Cites work

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

Cited in

(10)

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

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)