scientific article; zbMATH DE number 512979

zbMATH Open0790.68051MaRDI QIDQ4281689FDOQ4281689

Authors: Karol Habart 

Publication date: 10 March 1994

Title of this publication is not available (Why is that?)

zbMATH Keywords

random sequencesTuring reducibilityChaitin's theoremChaitin-Schnorr theorem

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Recursively (computably) enumerable sets and degrees (03D25)

Cited In (5)

• Sub-computable Boundedness Randomness
• Title not available (Why is that?)
• A measure-theoretic proof of Turing incomparability
• Random Oracle Reducibility
• Kobayashi compressibility

This page was built for publication:

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