Abstract
I discuss part of the solution for the ML-covering problem [1]. This passes through analytic notions such as martingale convergence and Lebesgue density; an understanding of the class of cost functions which characterizes K-triviality; and identifying the correct notion of randomness which corresponds to computing K-trivial sets, together with the construction of a smart K-trivial set. This is joint work with Bienvenu, Kučera, Nies, and Turetsky.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Miller, J.S., Nies, A.: Randomness and computability: open questions. Bull. Symb. Logic 12, 390–410 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Greenberg, N. (2013). Computing K-Trivial Sets by Incomplete Random Sets. In: Bonizzoni, P., Brattka, V., Löwe, B. (eds) The Nature of Computation. Logic, Algorithms, Applications. CiE 2013. Lecture Notes in Computer Science, vol 7921. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39053-1_26
Download citation
DOI: https://doi.org/10.1007/978-3-642-39053-1_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-39052-4
Online ISBN: 978-3-642-39053-1
eBook Packages: Computer ScienceComputer Science (R0)