Stack Exchange

Phil

United States

Age: 26

I am interested in algorithmic game theory. I have a B.S. in mathematics.

top accounts reputation activity favorites subscriptions
Top Questions
41 votes

What is the complexity class most closely associated with what the human mind can accomplish quickly?

cc.complexity-theory complexity-classes soft-question asked Mar 9 '11 at 17:06
cstheory.stackexchange.com

21 votes

Is there a reasonable automated proof system for TCS theorems?

lo.logic turing-machines software proof-assistants automated-theorem-proving asked Jan 14 '11 at 0:32
cstheory.stackexchange.com

20 votes

How are real numbers specified in computation?

cc.complexity-theory computability na.numerical-analysis computing-over-reals computable-analysis asked Oct 9 '10 at 15:18
cstheory.stackexchange.com

15 votes

Should experts in TCS charge money to read proofs that P != NP?

soft-question asked Jan 23 '11 at 0:52
cstheory.stackexchange.com

14 votes

Are there descriptive complexity representations of quantum complexity classes?

cc.complexity-theory quantum-computing descriptive-complexity asked Dec 1 '10 at 19:35
cstheory.stackexchange.com

14 votes

What are some ingredients of really engaging non-fiction?

style non-fiction asked Dec 18 '10 at 22:21
writers.stackexchange.com

11 votes

Does the existence of PH-complete problems relativize?

cc.complexity-theory complexity-classes asked Nov 17 '10 at 20:31
cstheory.stackexchange.com

10 votes

Algorithms for Nash equilibrium computation.

ds.algorithms gt.game-theory asked Oct 7 '10 at 0:53
cstheory.stackexchange.com

10 votes

Could a descriptive complexity version of Rice's theorem be used to separate AC0 and PSPACE?

cc.complexity-theory complexity-classes descriptive-complexity separation asked Dec 29 '10 at 19:06
cstheory.stackexchange.com

9 votes

Can relativization results be used to prove sentences formally independent?

lo.logic relativization asked Nov 18 '10 at 20:33
cstheory.stackexchange.com

1 2

Top Answers