Theoretical Computer Science
Timothy Chow
  • Member for 11 years, 1 month
  • Last seen more than a week ago
Profile Activity
Stats
6,963
reputation
93k
reached
28
answers
10
questions
Communities
View all
Badges
View all badges
This user doesn’t have any gold badges yet.
32
silver badges
39
bronze badges
Top tags
View all tags
239
Score
20
Posts
53
Posts %
102
Score
4
Posts
11
Posts %
86
Score
4
Posts
11
Posts %
78
Score
3
Posts
8
Posts %
63
Score
2
Posts
5
Posts %
51
Score
3
Posts
8
Posts %
Top posts
View all questions and answers
All Questions Answers
Votes Newest
71
What would it mean to disprove Church-Turing thesis?
Feb 9 '11
50
Is there a sensible notion of an approximation algorithm for an undecidable problem?
Dec 29 '10
49
Which interesting theorems in TCS rely on the Axiom of Choice? (Or alternatively, the Axiom of Determinacy?)
Dec 30 '10
47
Ways for a mathematician to stay informed of current research in complexity theory
Jan 4 '11
34
Should experts in TCS charge money to read proofs that P != NP?
Jan 27 '11
28
Cohomological approach to boolean complexity
Apr 6 '11
27
Maximal/maximum independent sets
Aug 7 '11
27
Does P contain languages whose existence is independent of PA or ZFC? (TCS community wiki)
Jun 12 '12
22
Implications of unprovability of $P\neq NP$
Feb 6 '12
16
Casual tours around proofs
Nov 9 '11
Top Meta posts
1
0
6
Making a question easier to find
Top network posts
View all network posts
150
Do you read the masters?
132
Why do we care about $L^p$ spaces besides $p = 1$, $p = 2$, and $p = \infty$?
128
Suggestions for special lectures at next ICM
115
Not especially famous, long-open problems which anyone can understand
112
Nonequivalent definitions in Mathematics

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.