2 citations · 2 across the 5 of their papers we have counts for
9 papers · 1 filter
Aspects of Muchnik's paradox in restricted betting
George Barmpalias, Lu Liu
Muchnik's paradox says that enumerable betting strategies are not always reducible to enumerable strategies whose bets are restricted to either even rounds or odd rounds. In other…
The combinatorial equivalence of a computability theoretic question
Lu Liu
We show that a question of Miller and Solomon -- that whether there exists a coloring that does not admit a -computable variable word infinite solution,…
Coding power of product of partitions
Lu Liu
Given two combinatorial notions and , can we encode via . In this talk we address the question where is 3-c…
Upper bound on some hightness notions
Lu Liu
We give upper bound for several highness properties in computability randomness theory. First, we prove that discrete covering property does not imply the ability to compute a 1-ra…
Which DNR can be minimal
Lu Liu
Khan and Miller proved that for every computable non decreasing unbounded function (henceforth order function), if is sufficiently large, then there exists a …
Avoid Schnorr randomness
Lu Liu
We prove that every finite partition of admit an infinite subset that does not compute a Schnorr random real. We use this result to answer two questions of Brendle, Brooke-Tayl…