4 papers
Dichotomy results for classes of countable graphs
Vittorio Cipriani, Ekaterina Fokina, Matthew Harrison-Trainor +2
We study classes of countable graphs where every member does not contain a given finite graph as an induced subgraph -- denoted by for a given finite g…
Comparing disorder and adaptability in stochasticity
Liling Ko, Justin Miller
In the literature, there are various notions of stochasticity which measure how well an algorithmically random set satisfies the law of large numbers. Such notions can be categoriz…
Towards characterizing the -fickle recursively enumerable Turing degrees
Liling Ko
Given a finite lattice that can be embedded in the recursively enumerable (r.e.) Turing degrees , it is not known how one can characterize the degrees…
Nonlowness independent from frequent mind changes
Liling Ko
It was recently shown that the computably enumerable (c.e.) degrees that embed the critical triple (Downey, Greenberg, Weber 2007) and the M3 lattice structure (Downey, Greenberg 2…