Random closed sets viewed as random recursions

DOI10.1007/S00153-009-0126-6zbMATH Open1165.03027OpenAlexW2009920879MaRDI QIDQ1016507FDOQ1016507

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

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

zbMATH Keywords

Hausdorff dimensionHausdorff measurerandom closed setsrandom recursion

Mathematics Subject Classification ID

Applications of computability and recursion theory (03D80)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Statistically self-similar fractals
• Random Recursive Constructions: Asymptotic Geometric and Topological Properties
• Packing measure and dimension of random fractals
• The exact Hausdorff dimension in random recursive constructions
• Algorithmic Randomness of Closed Sets

Cited In (8)

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

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)