Skip to main content
Theoretical Computer Science
Scott Aaronson's user avatar
Scott Aaronson's user avatar
Scott Aaronson's user avatar
Scott Aaronson
  • Member for 13 years, 11 months
  • Last seen more than a month ago
Profile Activity
Stats
13,813
reputation
122k
reached
42
answers
11
questions
Communities
View all
Badges
View all badges
2
gold badges
63
silver badges
68
bronze badges
Top tags
View all tags
595
Score
30
Posts
57
Posts %
220
Score
15
Posts
28
Posts %
199
Score
5
Posts
9
Posts %
168
Score
6
Posts
11
Posts %
110
Score
6
Posts
11
Posts %
86
Score
5
Posts
9
Posts %
Top posts
View all questions and answers
answer
108
A simple decision problem whose decidability is not known
Sep 4, 2013
answer
76
Applicability of Church-Turing thesis to interactive models of computation
Aug 25, 2012
question
64
Overarching reasons why problems are in P or BPP
Oct 3, 2013
question
54
Rigorous security proof for Wiesner's quantum money?
Oct 24, 2011
answer
50
Techniques for showing that problem is in hardness "limbo"
Feb 5, 2014
answer
46
Extended Church-Turing Thesis
Jul 29, 2011
answer
42
Should experts in TCS charge money to read proofs that P != NP?
Aug 5, 2011
answer
41
Are there canonical non-relativizing techniques?
Oct 9, 2010
question
40
Circuit lower bounds over arbitrary sets of gates
Sep 30, 2010
answer
40
Is $PH \subseteq PP$?
Nov 24, 2010
Top Meta posts
0
1
18
How-to-model-this questions
Top network posts
View all network posts
35
What errors would one learn from Eliezer Yudkowsky's introduction to quantum physics?
30
If the ground states of interacting QFTs are so complicated, how did Nature find them?
23
Reversing gravitational decoherence
22
Can a parallel computer simulate a quantum computer? Is BQP inside NP?
20
Hawking radiation and reversibility