Algorithmic Randomness and Capacity of Closed Sets

DOI10.2168/LMCS-7(3:16)2011zbMath1237.03026arXiv1106.2993OpenAlexW1998556335MaRDI QIDQ3224682

Sebastian Wyman, Paul Brodhead, Douglas Cenzer, Ferit Toska

Publication date: 2 April 2012

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1106.2993

zbMATH Keywords

computable analysisalgorithmic randomnesseffective capacityeffectively closed sets

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45) Algorithmic randomness and dimension (03D32) Computation over the reals, computable analysis (03D78)

Related Items (3)

The Intersection of Algorithmically Random Closed Sets and Effective Dimension ⋮ Algorithmically Random Functions and Effective Capacities ⋮ Effective randomness of unions and intersections

This page was built for publication: Algorithmic Randomness and Capacity of Closed Sets