Calculus of cost functions
From MaRDI portal
Recommendations
Cites work
- K-triviality in computable metric spaces
- Algorithmic randomness and complexity.
- Benign cost functions and lowness properties
- Characterizing the strongly jump-traceable sets via randomness
- Coherent randomness tests and computing the \(K\)-trivial sets
- Computability and randomness
- Computuing K-trivial sets by incomplete random sets
- Demuth randomness and computational complexity
- Density, forcing, and the covering problem
- scientific article; zbMATH DE number 4091484 (Why is no real title available?)
- scientific article; zbMATH DE number 2063218 (Why is no real title available?)
- scientific article; zbMATH DE number 1542867 (Why is no real title available?)
- scientific article; zbMATH DE number 3995657 (Why is no real title available?)
- Interactions of computability and randomness
- Low upper bounds of ideals
- Lowness for the class of random sets
- Lowness properties and approximations of the jump
- Lowness properties and randomness
- Solovay functions and their applications in algorithmic randomness
- Strong jump-traceability and Demuth randomness
- Using random sets as oracles
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)