Limit computability and constructive measure

zbMATH Open1175.03026MaRDI QIDQ3530395FDOQ3530395

Authors: Denis R. Hirschfeldt, Sebastiaan A. Terwijn 

Publication date: 20 October 2008

Recommendations

• scientific article; zbMATH DE number 1795232
• Hausdorff-dimension and weak truth-table reducibility
• Constructive dimension and Turing degrees
• Controlling effective packing dimension of \(\Delta_2^0\) degrees
• scientific article; zbMATH DE number 2216397

zbMATH Keywords

constructive Hausdorff dimensionconstructive measure

Mathematics Subject Classification ID

Algorithmic randomness and dimension (03D32) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Cited In (14)

• Limits for paraconsistent calculi
• Measure-theoretic applications of higher Demuth's theorem
• Continuous randomness via transformations of 2-random sequences
• Title not available (Why is that?)
• Controlling effective packing dimension of \(\Delta_2^0\) degrees
• Avoiding effective packing dimension 1 below array noncomputable c.e. degrees
• Covering the Recursive Sets
• Logical Approaches to Computational Barriers
• Calibrating the complexity of \(\Delta_2^0\) sets via their changes
• Effective bounds for convergence, descriptive complexity, and natural examples of simple and hypersimple sets
• Title not available (Why is that?)
• Title not available (Why is that?)
• Covering the recursive sets
• On the computability of perfect subsets of sets with positive measure

This page was built for publication: Limit computability and constructive measure

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