scientific article; zbMATH DE number 1335897

MaRDI QIDQ4258588zbMATH OpenFDO

Authors Jack H. Lutz

Publication date 4 May 2000

zbMATH Keywords

complexity classesresource-bounded measurability

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• A stronger Kolmogorov zero-one law for resource-bounded measure
• Resource-bounded measure on probabilistic classes
• An outer-measure approach for resource-bounded measure
• scientific article; zbMATH DE number 1048036
• Axiomatizing resource bounds for measure

Cited in

(19)

• Logical Approaches to Computational Barriers
• scientific article; zbMATH DE number 1860654 (Why is no real title available?)
• Computational depth and reducibility
• Resource bound certification
• Compressibility and resource bounded measure
• A stronger Kolmogorov zero-one law for resource-bounded measure
• An upward measure separation theorem
• Axiomatizing resource bounds for measure
• Measure on P: Robustness of the notion
• A Characterization of Constructive Dimension
• A characterization of constructive dimension
• Computability versus exact computability of martingales
• Resource-bounded measure on probabilistic classes
• Weakly complete problems are not rare
• On Resource-Bounded Versions of the van Lambalgen Theorem
• Scaled dimension and nonuniform complexity
• Compressibility and resource bounded measure
• Effective fractal dimensions
• An outer-measure approach for resource-bounded measure

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