Peter Gerdes

71 reputation

bio	website	invariant.org
	location
	age	33
visits	member for	1 year
	seen	Apr 13 at 6:18
stats	profile views	9

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.

	71 reputation	bio	website	invariant.org	visits	member for	1 year
3 badges		location			seen	Apr 13 at 6:18

summary answers questions tags badges favorites bounties reputation activity

5 Answers

votes activity newest

2	A non-arithmetical set?
2	Consequences of Incompleteness.
2	Projecting onto (lightface) Borel sets
1	Applications of descriptive set theory to mathematical logic?
0	Must a function that 'preserves r.e.-ness' be computable itself?

71 Reputation

+10	Applications of descriptive set theory to mathematical logic?
+20	A non-arithmetical set?
+10	Projecting onto (lightface) Borel sets
+10	Consequences of Incompleteness.

0 Questions

votes activity newest

This user has not asked any questions

5 Tags

7 logic × 4	3 descriptive-set-theory × 2
4 computability × 3	2 computer-science
3 reference-request × 2

8 Accounts

$TeX - LaTeX Stack Exchange$	TeX - LaTeX	128 rep	5
$Mathematics Stack Exchange$	Mathematics	71 rep	3
	Stack Overflow	36 rep	3
	Super User	11 rep	1
	Meta Stack Overflow	1 rep

3 Badges

recent class name

Editor	Teacher
Supporter

0 Active bounties

active offered earned

This user has no active bounties

0 Votes Cast

This user has not cast any votes

user feed