Computer Science
Profile Activity
Meta user
Network profile
2,027
reputation
5
15

Noah Schweber

A postdoc at UW-Madison (previously a grad student at UC-Berkeley), interested in mathematical logic - specifically, computability theory and reverse mathematics, set theory, and abstract model theory. I'm also interested in other Nifty Things, in mathematics and elsewhere.

58
answers
0
questions
~20k
people reached

Communities (16)

Top network posts

Top tags (0)

This user has not participated in any tags.

Top posts (58)

All Questions Answers
Votes Newest
16 Language to define perfectly a programming problem Nov 5 '19
10 A problem in NP but not NP-complete? Jan 5 '20
8 Understanding definition of NP and co-NP Apr 18 '20
7 All languages are regular, as unions of singleton languages Oct 11 '19
7 Represent there are infinitely many in FOL Jul 19 '18
6 Turing degree incomparable with any countable-ordinal jump of another Turing degree? May 31 '18
5 Example of two undecidable languages that cannot be mapping reduced to each other Nov 21 '19
5 Would a sparse NP-Complete language imply L = NP? Apr 17 '20
5 Why doesn't the recursion theorem prove there is an undecidable finite set? Feb 29 '20
5 Are there infinite possibilities to the outcome of the P vs. NP question? Aug 24 '18
View all questions and answers →

Badges (20)

Gold

—

Silver

5

Rarest

Bronze

15

Rarest

View all badges →