Logical Approaches to Computational Barriers

DOI10.1007/11780342MaRDI QIDQ5898802zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

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

Mathematics Subject Classification ID

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

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

Cited in

(17)

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

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)