Theoretical Computer Science
Philip White
  • Member for 11 years, 4 months
  • Last seen more than 1 year ago
  • United States
Profile Activity
Stats
5,040
reputation
91k
reached
20
answers
24
questions
Communities
View all
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

Badges
View all badges
1
gold badge
25
silver badges
42
bronze badges
Top tags
View all tags
21
Score
19
Posts
43
Posts %
13
Score
7
Posts
16
Posts %
9
Score
7
Posts
16
Posts %
9
Score
3
Posts
7
Posts %
9
Score
3
Posts
7
Posts %
5
Score
6
Posts
14
Posts %
Top posts
View all questions and answers
All Questions Answers
Votes Newest
85
Was the reduction in Shor's algorithm originally discovered by Shor?
Aug 13 '14
62
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
Top Meta posts
2
3
8
Why the extreme strictness on topic closing?
6
Stop using the word "crank" on CStheory.se
Top network posts
View all network posts
16
What should step one in writing a novel be?
15
What are some ingredients of really engaging non-fiction?
10
How difficult is it to break into screenwriting?
9
Compiler that compiles to a Turing machine?
5
Inference rules in ZFC

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.