Computer Science
Profile Activity
Meta user
Network profile
2,239
reputation
6
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.

63
answers
0
questions
~24k
people reached

Communities (21)

Top network posts

Top tags (42)

Score 56
Posts 23
Posts % 37
Score 41
Posts 18
Score 32
Posts 6
Score 28
Posts 11
Score 25
Posts 5
Score 18
Posts 9
View all tags →

Top posts (63)

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 Are the sets in $\Sigma_{p}$ (or $\Pi_{p}$) totally ordered? Apr 12
6 Example of two undecidable languages that cannot be mapping reduced to each other Nov 21 '19
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 '20
5 Why doesn't the recursion theorem prove there is an undecidable finite set? Feb 29 '20
View all questions and answers →

Badges (21)

Gold

—

Silver

6

Rarest

Bronze

15

Rarest

View all badges →

Your privacy

By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.