I'm a mathematician working in computability theory a.k.a. recursion theory, a branch of mathematical logic studying what computers (aka Turing machines) could in principle compute. Or more accurately when does being given access to the solution of one kind of problem (aka an oracle) allow the computer to solve some other problem. Currently focused on research about the $\alpha$-REA degrees.
I'm also the maintainer of the rec-thy latex package designed to give a common set of basic commands for the working mathematician in computability theory.
This user hasn’t posted yet.