We’re rewarding the question askers & reputations are being recalculated! Read more.
Theoretical Computer Science
Meta user
Network profile
4,892
reputation
23
40

Philip White

I have a B.S. in mathematics.

20
answers
24
questions
~79k
people reached
  • United States
  • youtube.com/…
  • Member for 9 years, 1 month
  • 681 profile views
  • Last seen Nov 13 at 20:09

Communities (13)

Top Meta Posts
2
3

Top network posts

Top tags (48)

Score 20
Posts 19
Posts % 43
Score 13
Posts 7
Score 9
Posts 7
Score 9
Posts 3
Score 9
Posts 3
Score 5
Posts 6
View all tags →

Top posts (44) All Questions Answers | Votes Newest

79 Was the reduction in Shor's algorithm originally discovered by Shor? Aug 13 '14
59 What is the complexity class most closely associated with what the human mind can accomplish quickly? Mar 9 '11
29 If P = NP were true, would quantum computers be useful? Feb 4 '15
28 Is there a reasonable automated proof system for TCS theorems? Jan 14 '11
27 How are real numbers specified in computation? Oct 9 '10
20 Are there descriptive complexity representations of quantum complexity classes? Dec 1 '10
20 Who introduced nondeterministic computation? Aug 29 '15
18 Should experts in TCS charge money to read proofs that P != NP? Jan 23 '11
16 Explain P = NP problem to 10 year old Feb 27 '11
12 Does the existence of PH-complete problems relativize? Nov 17 '10
View all questions and answers →

Badges (63)

Gold

—

Silver

23

Rarest

Bronze

40

Rarest

View all badges →