Calculus of cost functions
From MaRDI portal
Publication:6599292
DOI10.1007/978-3-319-43669-2_12zbMATH Open1544.03035MaRDI QIDQ6599292
Publication date: 6 September 2024
Constructive and recursive analysis (03F60) Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Coherent randomness tests and computing the \(K\)-trivial sets
- Characterizing the strongly jump-traceable sets via randomness
- Solovay functions and their applications in algorithmic randomness
- Demuth randomness and computational complexity
- Density, forcing, and the covering problem
- Lowness properties and approximations of the jump
- Lowness properties and randomness
- \(K\)-triviality in computable metric spaces
- Computuing \(K\)-trivial sets by incomplete random sets
- Benign cost functions and lowness properties
- Kolmogorov complexity and the Recursion Theorem
- Algorithmic Randomness and Complexity
- Low upper bounds of ideals
- Lowness for the class of random sets
- Using random sets as oracles
- Strong jump-traceability and Demuth randomness
Related Items (1)
This page was built for publication: Calculus of cost functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6599292)
