Logical Approaches to Computational Barriers

DOI10.1007/11780342zbMATH Open1145.68437OpenAlexW4255986326MaRDI QIDQ5898802FDOQ5898802

Authors: Paul Brodhead, Douglas Cenzer, Seyyed Dashti 

Publication date: 30 April 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11780342

Recommendations

• Algorithmic Randomness of Closed Sets
• Martin-Löf randomness in spaces of closed sets
• Random Continuous Functions
• Random closed sets viewed as random recursions
• The interplay of classes of algorithmically random objects

zbMATH Keywords

ComputabilityRandomness\(\Pi^{0}_{1}\) Classes

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Cited In (17)

• Algorithmic Randomness of Closed Sets
• The random members of a \({\Pi }_{1}^{0}\) class
• A strong law of computationally weak subsets
• Computability of probability measures and Martin-Löf randomness over metric spaces
• Random closed sets viewed as random recursions
• Algorithmic randomness and capacity of closed sets
• Effective randomness of unions and intersections
• Members of Random Closed Sets
• Martin-Löf randomness and Galton-Watson processes
• Title not available (Why is that?)
• Algorithmic randomness of continuous functions
• Martin-Löf randomness in spaces of closed sets
• Random Continuous Functions
• The interplay of classes of algorithmically random objects
• On the Topological Size of Sets of Random Strings
• Immunity for closed sets
• Title not available (Why is that?)

This page was built for publication: Logical Approaches to Computational Barriers

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