Abstract
AbstractI 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
