User Bjørn Kjos-Hanssen

7 votes

Accepted

Is DNC/DNR stronger than "prompt" non-computability?

answered Sep 23, 2015 at 21:19

7 votes

Accepted

The exceptional isomorphism between PGL(3,2) and PSL(2,7): geometric origin?

answered Dec 7, 2016 at 7:51

7 votes

Complexity of Turing Machine behavior

answered May 5, 2016 at 0:56

7 votes

Uncertainty principle and Cramer-Rao bound - is there relation?

answered Dec 27, 2011 at 8:51

7 votes

Does constructing non-measurable sets require the axiom of choice?

answered Oct 14, 2010 at 21:42

7 votes

Accepted

Turing degrees of nonstandard models of PA

answered Dec 26, 2010 at 5:10

7 votes

Accepted

The consistency of ZFC + CH gives the ability to travel to a universe which models ZFC + \neg CH?

answered Oct 24, 2010 at 8:28

7 votes

Which distributions can you sample if you can sample a Gaussian?

answered Apr 30, 2014 at 21:16

7 votes

Accepted

Über theorem on unavoidable patterns?

answered Jul 19, 2014 at 0:50

7 votes

(reference request) Chaitin's constant is incompressible

answered Aug 1, 2014 at 16:04

7 votes

Different notions of computable binary sequence

answered Nov 27, 2017 at 22:20

7 votes

Accepted

Cardinality of families of (almost) disjoint subsets

answered Jan 22, 2018 at 7:35

7 votes

Accepted

Decidability of the Hilbert lattice and quantum logic

answered Mar 25, 2018 at 19:35

7 votes

Accepted

Is there a name for this equivalence relation?

answered Oct 23, 2019 at 22:11

6 votes

The inequality $\Pi (1-\frac{1}{a_i})^{x_i} \le \Pi (1-\frac{1}{b_j})^{y_j} $ hold?

answered Oct 10, 2019 at 5:31

6 votes

Does the lattice of all topologies embed into the lattice of $T_1$-topologies?

answered Mar 14, 2018 at 7:17

6 votes

Accepted

Automorphism group of the Turing degrees

answered Jun 5, 2018 at 2:39

6 votes

Accepted

If Goldbach's Conjecture is eventually true, is it necessarily true?

answered Nov 17, 2018 at 7:53

6 votes

powers in strings

answered Mar 13, 2014 at 6:32

6 votes

Are there two computable binary trees such that each has a branch not computing any branch through the other?

answered Feb 13, 2014 at 6:03

6 votes

Online introduction to Lattice Theory?

answered Oct 27, 2010 at 20:25

6 votes

Accepted

Is the distance function from a point to the Mandelbrot set computable?

answered Oct 12, 2010 at 5:41

6 votes

Accepted

What is the probability a random Turing machine is isomorphic to a DFA?

answered Aug 18, 2010 at 6:29

6 votes

Toy Models of Quantum Mechanics

answered Mar 20, 2011 at 5:43

6 votes

Undecidable problems in geometry

answered Sep 22, 2011 at 20:52

6 votes

Accepted

A computability-theoretic preorder on reals

answered Jun 20, 2013 at 23:55

6 votes

Why aren't fields called "bodies" instead?

answered Jan 23, 2014 at 4:25

6 votes

Accepted

Is 0' of PA degree relative to a non-low set?

answered Jan 10, 2014 at 16:38

6 votes

Accepted

What Turing degree is this function?

answered May 9, 2016 at 17:53

6 votes

What is the term for combining functions $f_1,f_2,\dots,f_n$ into a tuple $(f_1,\dots,f_n)$?

answered Oct 6, 2015 at 18:33

Stack Exchange Network

415 Answers

Is DNC/DNR stronger than "prompt" non-computability?

The exceptional isomorphism between PGL(3,2) and PSL(2,7): geometric origin?

Complexity of Turing Machine behavior

Uncertainty principle and Cramer-Rao bound - is there relation?

Does constructing non-measurable sets require the axiom of choice?

Turing degrees of nonstandard models of PA

The consistency of ZFC + CH gives the ability to travel to a universe which models ZFC + \neg CH?

Which distributions can you sample if you can sample a Gaussian?

Über theorem on unavoidable patterns?

(reference request) Chaitin's constant is incompressible

Different notions of computable binary sequence

Cardinality of families of (almost) disjoint subsets

Decidability of the Hilbert lattice and quantum logic

Is there a name for this equivalence relation?

The inequality $\Pi (1-\frac{1}{a_i})^{x_i} \le \Pi (1-\frac{1}{b_j})^{y_j} $ hold?

Does the lattice of all topologies embed into the lattice of $T_1$-topologies?

Automorphism group of the Turing degrees

If Goldbach's Conjecture is eventually true, is it necessarily true?

powers in strings

Are there two computable binary trees such that each has a branch not computing any branch through the other?

Online introduction to Lattice Theory?

Is the distance function from a point to the Mandelbrot set computable?

What is the probability a random Turing machine is isomorphic to a DFA?

Toy Models of Quantum Mechanics

Undecidable problems in geometry

A computability-theoretic preorder on reals

Why aren't fields called "bodies" instead?

Is 0' of PA degree relative to a non-low set?

What Turing degree is this function?

What is the term for combining functions $f_1,f_2,\dots,f_n$ into a tuple $(f_1,\dots,f_n)$?