Computer Science
Profile Activity
Meta user
Network profile
1,821
reputation
5
14

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.

49
answers
0
questions
~16k
people reached

Communities (15)

Top network posts

Top tags (35)

Score 42
Posts 17
Posts % 35
Score 32
Posts 14
Score 31
Posts 5
Score 22
Posts 10
Score 21
Posts 4
Score 15
Posts 8
View all tags →

Top posts (49)

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
7 Understanding definition of NP and co-NP Apr 18
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 Would a sparse NP-Complete language imply L = NP? Apr 17
5 Why doesn't the recursion theorem prove there is an undecidable finite set? Feb 29
5 Example of two undecidable languages that cannot be reduced to each other Nov 21 '19
5 Are there infinite possibilities to the outcome of the P vs. NP question? Aug 24 '18
View all questions and answers →

Badges (19)

Gold

—

Silver

5

Rarest

Bronze

14

Rarest

View all badges →