Russell Miller
Email:
Office: Kiely 404
Phone: 997-5853
Highest Degree
Ph.D., University of Chicago
Specialty
Mathematical Logic, Computability Theory
Interests and Activities
I study computability theory, the branch of mathematical logic
concerned with finite algorithms and the mathematical problems which
such algorithms can or cannot solve. By relativizing, one forms a
partial order of the degrees of difficulty (the Turing degrees) of such
problems. Computable model theory, one of my specialties, applies such
techniques to general mathematical structures such as trees, linear
orders, groups, fields, and algebraic varieties. Other interests of
mine lie in pure computability theory; these include automorphisms of
the lattice of computably enumerable sets (i.e., sets whose elements
can be listed by an algorithm) and undecidability of the partial order
of Turing degrees of those sets.
