894
reputation
4
13

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

19
answers
19
questions
~20k
people reached

Top tags (26)

Score 25
Posts 30
Posts % 79
Score 21
Posts 32
Score 14
Posts 4
Score 6
Posts 5
Score 3
Posts 13
Score 2
Posts 2

Top posts (38)

View all questions and answers

Badges (17)

Gold

Silver

4

Rarest

Bronze

13

Rarest