scientific article; zbMATH DE number 1064112

MaRDI QIDQ4355680zbMATH OpenFDO

Authors Asat Arslanov

Publication date 21 September 1997

zbMATH Keywords

Chaitin complexitycomputably enumerable setfixed-point free functionrandom sequence

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• Uniform van Lambalgen's theorem fails for computable randomness
• Van Lambalgen's theorem and high degrees
• Conditional measure and the violation of van Lambalgen's theorem for Martin-Löf randomness
• On relative randomness

Cited in

(5)

• Proof of a conjecture of de Caen and van Dam
• Uniform van Lambalgen's theorem fails for computable randomness
• When van Lambalgen’s Theorem fails
• Van Lambalgen's theorem and high degrees
• The complexity of the set of nonrandom numbers

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 Q4355680)