A stronger Kolmogorov zero-one law for resource-bounded measure

DOI10.1016/S0304-3975(02)00320-1zbMATH Open1026.68070MaRDI QIDQ1870565FDOQ1870565

Authors: Jack Jie Dai 

Publication date: 14 May 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 1335897
• scientific article; zbMATH DE number 1346358
• Resource-bounded measure on probabilistic classes
• Compressibility and resource bounded measure
• Compressibility and resource bounded measure

zbMATH Keywords

computational complexitymartingaleresource-bounded measureKolmogorov zero-one law

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Cites Work

• Process complexity and effective random tests
• A unified approach to the definition of random sequences
• Almost everywhere high nonuniform complexity
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Klassifikation der Zufallsgesetze nach Komplexit�t und Ordnung
• Title not available (Why is that?)

Cited In (4)

• Axiomatizing resource bounds for measure
• An outer-measure approach for resource-bounded measure
• An upward measure separation theorem
• Resource-bounded measure on probabilistic classes

This page was built for publication: A stronger Kolmogorov zero-one law for resource-bounded measure

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