User David Harris

42 votes

4 answers

2k views

Inconsistent theory with long contradiction

asked Jan 14, 2011 at 13:19

33 votes

18 answers

6k views

Non-rigorous reasoning in rigorous mathematics

asked Nov 30, 2012 at 23:12

23 votes

10 answers

5k views

Completeness vs Compactness in logic

asked Jun 25, 2011 at 14:00

20 votes

10 answers

4k views

Expected value as decision criterion in the context of rare events

asked Dec 31, 2010 at 14:39

16 votes

2 answers

3k views

Can randomness add computability?

asked Mar 10, 2011 at 11:50

15 votes

1 answer

817 views

Undecidable theories easier than $Q$

asked Jul 5, 2011 at 16:41

14 votes

3 answers

3k views

Definition of relativization of complexity class

asked Sep 19, 2011 at 22:20

12 votes

3 answers

4k views

Number of spanning trees which contain a given edge

asked Nov 18, 2011 at 14:28

12 votes

3 answers

3k views

Lower bound on # spanning trees in a connected graph

asked Jun 6, 2011 at 15:32

11 votes

1 answer

1k views

Machine model for primitive recursion?

asked Aug 17, 2011 at 14:59

11 votes

2 answers

1k views

Am I allowed to do non-rigorous numerical analysis?

asked Oct 19, 2011 at 13:05

7 votes

1 answer

362 views

RAM simulating another RAM

asked Jul 26, 2011 at 14:32

7 votes

2 answers

1k views

Models of computation with decidable halting problem?

asked Jun 16, 2011 at 11:47

7 votes

3 answers

423 views

Increasing tower of subsets of ${1, ..., k}$

asked Feb 7, 2014 at 16:37

7 votes

2 answers

731 views

How close to an integer can a polynomial root be?

asked Feb 27, 2015 at 16:23

7 votes

0 answers

214 views

Bound on chromatic number for a class of graphs

asked Nov 18, 2016 at 0:45

5 votes

0 answers

148 views

Fractional chromatic number for triangle-free d-degenerate graphs

asked Nov 25, 2016 at 15:14

5 votes

0 answers

500 views

# roots of polynomials over GF(2)

asked Mar 17, 2014 at 22:29

5 votes

1 answer

322 views

Block design question

asked Nov 20, 2012 at 12:30

5 votes

0 answers

581 views

When is polytope compatible with network flow?

asked Apr 7, 2011 at 11:08

5 votes

2 answers

825 views

Semantic definition of sentence

asked Jun 30, 2011 at 14:37

5 votes

3 answers

1k views

Branching process survival probability

asked Feb 1, 2012 at 3:30

4 votes

1 answer

729 views

Proof system with same complexity as "informal mathematics"?

asked Aug 19, 2011 at 12:47

4 votes

2 answers

662 views

# bridges in random connected graph

asked Jun 13, 2011 at 15:53

4 votes

1 answer

1k views

Spanning trees of $k$-edge-connected graphs

asked Jun 23, 2011 at 16:32

3 votes

2 answers

375 views

Bounds on spanning tree for sparse graphs

asked Aug 30, 2011 at 17:47

3 votes

4 answers

285 views

Spanning trees of $H \cup e$ in terms of $H$

asked Sep 12, 2011 at 14:20

3 votes

0 answers

366 views

Amortized analysis of data structure via potential function

asked Jul 24, 2011 at 13:27

3 votes

3 answers

792 views

An Optimization problem

asked Feb 10, 2012 at 21:14

3 votes

0 answers

225 views

Bounds on number of small minimal cut-sets in graph?

asked Dec 23, 2011 at 14:30

Stack Exchange Network

59 Questions

Inconsistent theory with long contradiction

Non-rigorous reasoning in rigorous mathematics

Completeness vs Compactness in logic

Expected value as decision criterion in the context of rare events

Can randomness add computability?

Undecidable theories easier than $Q$

Definition of relativization of complexity class

Number of spanning trees which contain a given edge

Lower bound on # spanning trees in a connected graph

Machine model for primitive recursion?

Am I allowed to do non-rigorous numerical analysis?

RAM simulating another RAM

Models of computation with decidable halting problem?

Increasing tower of subsets of ${1, ..., k}$

How close to an integer can a polynomial root be?

Bound on chromatic number for a class of graphs

Fractional chromatic number for triangle-free d-degenerate graphs

# roots of polynomials over GF(2)

Block design question

When is polytope compatible with network flow?

Semantic definition of sentence

Branching process survival probability

Proof system with same complexity as "informal mathematics"?

# bridges in random connected graph

Spanning trees of $k$-edge-connected graphs

Bounds on spanning tree for sparse graphs

Spanning trees of $H \cup e$ in terms of $H$

Amortized analysis of data structure via potential function

An Optimization problem

Bounds on number of small minimal cut-sets in graph?