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).

David Harris

2,599
Reputation
1469 views
Is this your account?

Registered User 

Name David Harris
Member for 2 years
Seen 9 hours ago
Website
Location
Age
44

Questions
votes newest views recent
8
33
votes
3
answers
1k
views

Inconsistent theory with long contradiction

jun 8 11 at 17:39 Mirco Mannucci 2,019●8●18

6

1
15
votes
1
answer
659
views

Undecidable theories easier than $Q$

jul 5 11 at 18:35 Carl Mummert 4,972●1●16●28

10
14
votes
10
answers
2k
views

Completeness vs Compactness in logic

jun 27 11 at 21:44 Ali Enayat 4,459●1●9●23

3
13
votes
2
answers
691
views

Can randomness add computability?

jun 12 at 6:45 none 11●1

7
9
votes
11
answers
2k
views

Non-rigorous reasoning in rigorous mathematics

dec 5 at 0:24 P Vanchinathan 753●3●10

1
8
votes
2
answers
896
views

Am I allowed to do non-rigorous numerical analysis?

oct 20 11 at 0:15 Nilima Nigam 976●6●14

2
8
votes
3
answers
666
views

Number of spanning trees which contain a given edge

nov 18 11 at 21:36 Ori Gurel-Gurevich 4,326●1●8●18

1
7
votes
1
answer
290
views

RAM simulating another RAM

jul 26 11 at 18:15 David Harris 2,599●1●4●18

 
7
votes
3
answers
505
views

Definition of relativization of complexity class

sep 21 11 at 14:05 Timothy Chow 15.2k●1●70●139

1 2 3 4 5 next

 

39

Answers
votes newest views recent
11
Why are so few operations with arity bigger than 2?
8
Philosophical Question related to Largest Known Primes
8
What are the external triumphs of matroid theory?
5
Are there examples of nonconstructive metaproofs?
5
Abstract notion for energy complexity of computational problems?
4
Graduate School
4
name for $\underset{x}{\operatorname{argmin}} \displaystyle\sum\limits_{i=1}^n |x_i - x|$
4
Blackbox Theorems
3
Lower Bound on the Cost of Solving Linear System
3
Which Turing machines accept the language of trivial words in a finitely presented group?
3
What notions are used but not clearly defined in modern mathematics? (2)
3
We know that a permutation of N bits {0, 1}^N --> {0,1}^N can be computed by circuits of size O(n 2^n). But are there circuits that can be computed only by size O((n^2)(2^n) and not O(n 2^n)
3
Graph properties: definability and decidability
3
Expressing a graph property with counting quantifiers
3
Is P=NP relevant to finding proofs of everyday mathematical propositions?
2
How do they verify a verifier of formalized proofs?
2
Bounding the roots of the sum of two polynomials
2
Why is it OK to rely on the Fundamental Theorem of Arithmetic when using Gödel numbering?
2
Can finitely many values of a polynomial determine it?
2
Random versions of deterministic problems
2
Godel 's Ladder: Undecidable PI_N sentences for N =2, 3, …
1
Standard Deviation of Averages of Random Numbers
1
2d moment of chebyshev
1
Proof that any NP problem can be reduced (in P time) to any problem in NPC?
1
Statistics - Subpopulation Random Sampling
1
Equivalence of monadic axioms
1
Finite graphs that realize all types over $n$-element sets
1
Question on Maximum Likelihood Estimation
1
What is a zero-mean error?
1
Expected value as decision criterion in the context of rare events
1 2 next

 

178

Votes
168
10

 

55

Tags
× 18
× 18
× 12
× 8
× 8
× 6
× 5
× 4
× 4
× 4
 × 3
× 3
× 3
× 3
× 2
× 2
× 2
× 2
× 2
× 2





























 

23

Badges
● Popular Question× 5
● Nice Question× 5
● Yearling× 2
 ● Fanatic
● Nice Answer
● Good Question
 ● Critic
● Enthusiast
● Commentator
 ● Scholar
● Editor
● Student
 ● Supporter
● Teacher