Random closed sets viewed as random recursions

DOI10.1007/S00153-009-0126-6MaRDI QIDQ1016507zbMATH OpenOpenAlexFDO

Authors R. Daniel Mauldin, Alexander P. McLinden

Publication date 6 May 2009

Published in Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00153-009-0126-6

zbMATH Keywords

Hausdorff dimensionHausdorff measurerandom closed setsrandom recursion

Mathematics Subject Classification ID

Applications of computability and recursion theory (03D80)

Recommendations

• Algorithmic Randomness of Closed Sets
• Logical Approaches to Computational Barriers
• Members of Random Closed Sets
• Dimensions of random recursive sets
• Exact Hausdorff dimension in random recursive constructions

Cites work

• scientific article; zbMATH DE number 44693 (Why is no real title available?)
• scientific article; zbMATH DE number 739280 (Why is no real title available?)
• scientific article; zbMATH DE number 3324894 (Why is no real title available?)
• Algorithmic Randomness of Closed Sets
• Packing measure and dimension of random fractals
• Random Recursive Constructions: Asymptotic Geometric and Topological Properties
• Statistically self-similar fractals
• The exact Hausdorff dimension in random recursive constructions

Cited in

(8)

• Exact constructive and computable dimensions
• Martin-Löf randomness in spaces of closed sets
• Members of Random Closed Sets
• Martin-Löf randomness and Galton-Watson processes
• Effectively closed sets of measures and randomness
• Logical Approaches to Computational Barriers
• Algorithmic Randomness of Closed Sets
• Constructive dimension and Hausdorff dimension: the case of exact dimension

This page was built for publication: Random closed sets viewed as random recursions

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