Martin-Löf reducibility and cost functions
From MaRDI portal
Publication:6561664
DOI10.1007/S11856-023-2565-XMaRDI QIDQ6561664FDOQ6561664
Authors: Noam Greenberg, Joseph S. Miller, André Nies, Dan Turetsky 
Publication date: 25 June 2024
Published in: Israel Journal of Mathematics (Search for Journal in Brave)
Cites Work
- Lowness properties and randomness
- Coherent randomness tests and computing the \(K\)-trivial sets
- Computability and Randomness
- Randomness, relativization and Turing degrees
- Difference randomness
- Title not available (Why is that?)
- Every sequence is reducible to a random one
- Strong jump-traceability. I: The computably enumerable case
- Lowness properties and approximations of the jump
- Benign cost functions and lowness properties
- Strong jump-traceability. II: \(K\)-triviality
- Characterizing the strongly jump-traceable sets via randomness
- Demuth randomness and computational complexity
- Computuing \(K\)-trivial sets by incomplete random sets
- Interactions of computability and randomness
- Title not available (Why is that?)
- Using random sets as oracles
- The axiomatization of randomness
- Strong jump-traceability and Demuth randomness
- Inherent enumerability of strong jump-traceability
- Title not available (Why is that?)
- Two more characterizations of \(K\)-triviality
- Denjoy, Demuth and density
- Strong jump-traceability
- Density, forcing, and the covering problem
- Nullifying randomness and genericity using symmetric difference
- Exact pairs for the ideal of the \(K\)-trivial sequences in the Turing degrees
- Computing from projections of random points
- Calculus of cost functions
This page was built for publication: Martin-Löf reducibility and cost functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6561664)
