Peter Gerdes
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 recthy latex package designed to give a common set of basic commands for the working mathematician in computability theory.

Auburn Hills, MI, USA

Member for 8 years, 11 months

375 profile views

Last seen Mar 9 at 23:51
Communities (21)
Top network posts
Badges (17)
Gold
Silver
Rarest
Bronze
Rarest

Jan 5 '19

Dec 11

Dec 21 '18