MathOverflow will be down for maintenance for approximately 3 hours, starting Monday evening (06/24/2013) at approximately 9:00 PM Eastern time (UTC-4).

Kaveh

2,197
Reputation
1239 views
Is this your account?

Registered User 

Name Kaveh
Member for 2 years
Seen 6 hours ago
Website
Location Toronto, Canada
Age
PhD student in University of Toronto, Department of Computer Science, Theory Group.
12

Questions
votes newest views recent
12

9
17
votes
4
answers
2k
views

Is the Riemann Hypothesis equivalent to a $\Pi_1$ sentence?

jul 23 10 at 4:12 T. 2,131●7●12

4

8

6

3

5

1

2

2

1 2 next

 

38

Answers
votes newest views recent
11
Where to publish a paper on the Mafia game?
10
Interpretation of the Second Incompleteness Theorem
9
Descriptive complexity theoretic-characterizations of P and NP
7
Structure theorems for Turing-decidable languages?
6
Proof systems and their hierarchy
6
Non-constructive proofs vs. efficient algorithms
5
How would calculus be possible in a finitist axiom system?
4
What is the time complexity of computing sin(x) to t bits of precision?
4
Definition of relativization of complexity class
4
Don’t the axioms of set theory implicitly assume numbers?
3
Propositions equivalent to the completeness of the real numbers
3
Is there a general setting for self-reference?
3
Oracle Results: P^A = NP^A
3
What was Gödel’s real achievement?
3
Lower Bounds in Theoretical Computer Science
2
Most ‘obvious’ open problems in complexity theory
2
Derivability conditions for Robinson arithmetic
2
Computable nonstandard models for weak systems of arithemtic
2
Solving NP problems in (usually) Polynomial time?
2
Completeness, easiest, hardest problems
2
Wolfram’s 2-state 3-symbol Turing machine
2
The best text to study both incompleteness theorems
2
Are computable models sufficient?
2
All properties of a mathematical object
2
Formal verification in complexity theory
2
Is the Axiom of Union independent of the rest of ZF?
2
Difference between turnstile and implication
2
Why can Diophantine equations represent exponential growth?
1
logics restricted in arithmetic hierarchy
1
Has Oracles actually provided intuition for proving anything in Complexity Theory?
1 2 next

 

1399

Votes
1363
36

 

48

Tags
× 27
× 26
× 8
× 7
× 5
× 4
× 4
× 4
× 4
× 4
 × 3
× 3
× 3
× 3
× 2
× 2
× 2
× 2
× 2
× 2
 × 2

















 

29

Badges
● Necromancer
● Nice Answer× 2
● Yearling× 2
● Popular Question× 5
 ● Civic Duty
● Nice Question× 6
● Cleanup
● Citizen Patrol
 ● Enthusiast
● Organizer
● Critic
● Commentator
 ● Scholar
● Editor
● Supporter
● Student
 ● Autobiographer
● Teacher