Computer Science
Meta user
Network profile
678
reputation
2
10

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.

16
answers
0
questions
~3k
people reached

Communities (11)

Top network posts

Top tags (16)

Score 22
Posts 8
Posts % 50
Score 14
Posts 4
Score 10
Posts 2
Score 7
Posts 1
Score 6
Posts 2
Score 5
Posts 2
View all tags →

Top posts (16) All Questions Answers | Votes Newest

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 Are there infinite possibilities to the outcome of the P vs. NP question? Aug 24 '18
4 Oracle machine solving halting problem for other oracle machines Aug 30 '18
3 What is the definition of computable partial function? Nov 3 '18
3 How to prove the following: Every set is Turing reducible to itself Oct 22 '18
3 If $\overline{M}$ is recursively enumerable and $A$ is recursive, what could we say about $A \cap M$? Jul 31 '18
3 When does an extendible 1:1 p.c. function have a 1:1 computable extension? Jul 14 '18
3 Can an FO formula with infinite length be expressed with an infinite set of finite formulas? Jun 11 '18
2 Proof that total computable functions are not enumerable Jul 29 '18
View all questions and answers →

Badges (12)

Gold

—

Silver

2

Rarest

Bronze

10

Rarest

View all badges →