7 citations · 7 across the 1 of their papers we have counts for
2 papers
math.LO2015
Computably Enumerable Sets that are Automorphic to Low Sets
Peter Cholak, Rachel Epstein
We work with the structure consisting of all computably enumerable (c.e.) sets ordered by set inclusion. The question we will partially address is which c.e.\ sets are autormorphic…
cs.LO2014★ 7 cited
Random strings and tt-degrees of Turing complete C.E. sets
Mingzhong Cai, Rodney G Downey, Rachel Epstein +2
We investigate the truth-table degrees of (co-)c.e.\ sets, in particular, sets of random strings. It is known that the set of random strings with respect to any universal prefix-fr…