2 citations · 6 across the 18 of their papers we have counts for
Showing 2020Show all
3 papers · 1 filter
math.LO2020
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,…
math.LO2020
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…
math.LO2020★ 2 cited
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…