Theoretical Computer Science
Philip White
  • United States
  • Member for 11 years, 1 month
Profile Activity
Stats
5,000
reputation
90k
reached
20
answers
24
questions
About

I have a B.S. in mathematics.

https://www.youtube.com/watch?v=Uz1Jwyxd4tE

https://www.youtube.com/watch?v=s6jaYJx7yeI

https://www.youtube.com/watch?v=_WKp1SinEK8

Communities (13)

Top Meta Posts
2
3

Top network posts

1
gold badge
25
silver badges
42
bronze badges
View all badges

Top tags (48)

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

Top posts (44)

All Questions Answers
Votes Newest
83 Was the reduction in Shor's algorithm originally discovered by Shor? Aug 13 '14
61 What is the complexity class most closely associated with what the human mind can accomplish quickly? Mar 9 '11
29 Is there a reasonable automated proof system for TCS theorems? Jan 14 '11
29 If P = NP were true, would quantum computers be useful? Feb 4 '15
27 How are real numbers specified in computation? Oct 9 '10
21 Are there descriptive complexity representations of quantum complexity classes? Dec 1 '10
20 Who introduced nondeterministic computation? Aug 29 '15
19 Should experts in TCS charge money to read proofs that P != NP? Jan 23 '11
17 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 →

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.