43 citations · 55 across the 12 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
math.LO2011
Categoricity Properties for Computable Algebraic Fields
Denis Hirschfeldt, Ken Kramer, Russell Miller +1
We examine categoricity issues for computable algebraic fields. We give a structural criterion for relative computable categoricity of these fields, and use it to construct a field…
math.LO2011★ 4 cited
Characterizing the strongly jump-traceable sets via randomness
Noam Greenberg, Denis Hirschfeldt, Andre Nies
We show that if a set is computable from every superlow 1-random set, then is strongly jump-traceable. This theorem shows that the computably enumerable (c.e.) strongly jum…