Skip to main content

Peter Gerdes

I'm a postdoc in computability theory a.k.a. recursion theory, a branch of mathematical logic studying what computers could in principle compute. Or more accurately when does being given access to the solution of one kind of problem A (so the computer can ask is n in the set of solutions to problem A) allow the computer to solve some other problem B.

Top Questions
1 2 3