activity
20062023
most citedThe hierarchy of equivalence relations on the natural numbers under computable reducibility

35 citations · 86 across the 22 of their papers we have counts for

collaborators
Showing 2012Show all

2 papers · 1 filter

math.LO2012

Computably Categorical Fields via Fermat's Last Theorem

Russell Miller, Hans Schoutens

We construct a computable, computably categorical field of infinite transcendence degree over the rational numbers, using the Fermat polynomials and assorted results from algebraic…

math.AC2012★ 4 cited

Computing Constraint Sets for Differential Fields

Russell Miller, Alexey Ovchinnikov, Dmitry Trushin

Kronecker's Theorem and Rabin's Theorem are fundamental results about computable fields F and the decidability of the set of irreducible polynomials over F. We adapt these theorems…