David Harris's user avatar
David Harris's user avatar
David Harris's user avatar
David Harris
  • Member for 13 years, 5 months
  • Last seen more than 2 years ago
4 votes

Nice examples/arguments that illustrating the coupling method in probability theory

7 votes

Nice examples/arguments that illustrating the coupling method in probability theory

2 votes
Accepted

Godel 's Ladder: Undecidable PI_N sentences for N =2, 3, ......

4 votes

Blackbox Theorems

0 votes

Recurrence T(N)=T(N/LOGN)+1

1 vote

2d moment of chebyshev

7 votes
Accepted

name for $\underset{x}{\operatorname{argmin}} \displaystyle\sum\limits_{i=1}^n |x_i - x|$

1 vote

Statistics - Subpopulation Random Sampling

1 vote
Accepted

Proof that any NP problem can be reduced (in P time) to any problem in NPC?

5 votes

Are there examples of nonconstructive metaproofs?

1 vote
Accepted

Standard Deviation of Averages of Random Numbers

3 votes

Which Turing machines accept the language of trivial words in a finitely presented group?

2 votes

Random versions of deterministic problems

1 vote

Finite graphs that realize all types over $n$-element sets

7 votes

What are the external triumphs of matroid theory?

10 votes

Philosophical Question related to Largest Known Primes

0 votes
Accepted

What is a maximal set in the context of argumentation in AI

-1 votes

What are some correct results discovered with incorrect (or no) proofs?

1 vote

Question on Maximum Likelihood Estimation

0 votes

How many samples to be confident?

1 vote
Accepted

Equivalence of monadic axioms

3 votes

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)

9 votes

What notions are used but not clearly defined in modern mathematics?

1 vote

Why is it OK to rely on the Fundamental Theorem of Arithmetic when using Gödel numbering?

3 votes

Graduate School

4 votes

Can finitely many values of a polynomial determine it?

5 votes

Abstract notion for energy complexity of computational problems?

2 votes

Demystifying complex numbers

5 votes
Accepted

Lower Bound on the Cost of Solving Linear System

0 votes

Seemingly complex logic/set-theoretic puzzle