Show simple item record

dc.contributor.authorBienvenu, Laurent
dc.contributor.authorGreenberg, Noam
dc.contributor.authorKučera, Antonin
dc.contributor.authorNies, André
dc.contributor.authorTuretsky, Dan
dc.date.accessioned2012-12-21T12:00:00Z
dc.date.accessioned2016-10-05T14:13:52Z
dc.date.available2012-12-21T12:00:00Z
dc.date.available2016-10-05T14:13:52Z
dc.date.issued2012-12-21
dc.identifier.urihttp://publications.mfo.de/handle/mfo/1049
dc.descriptionResearch in Pairs 2012en_US
dc.description.abstractWe show that a Martin-Lof random set for which the effective version of the Lebesgue density theorem fails computes every $K$-trivial set. Combined with a recent result by Day and Miller, this gives a positive solution to the ML-covering problem (Question 4.6 in Randomness and computability: Open questions. Bull. Symbolic Logic, 12(3):390{410, 2006). On the other hand, we settle stronger variants of the covering problem in the negative. We show that any witness for the solution of the covering problem, namely an incomplete random set which computes all $K$-trivial sets, must be very close to being Turing complete. For example, such a random set must be LR-hard. Similarly, not every $K$-trivial set is computed by the two halves of a random set. The work passes through a notion of randomness which characterises computing K-trivial sets by random sets. This gives a "smart" $K$-trivial set, all randoms from whom this set is computed have to compute all $K$-trivial sets.en_US
dc.language.isoenen_US
dc.publisherMathematisches Forschungsinstitut Oberwolfachen_US
dc.relation.ispartofseriesOberwolfach Preprints;2012,17
dc.titleK-Triviality, Oberwolfach randomness, and differentiabilityen_US
dc.typePreprinten_US
dc.identifier.doi10.14760/OWP-2012-17
local.scientificprogramResearch in Pairs 2012
local.series.idOWP-2012-17


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record