List questions from computability

Published on 24 Mar 2026 - 21:08

82

Views

Induction Can't Prove Complexity?

Published on 27 Mar 2026 - 18:25

79

Views

Kolmogorov complexity of substring if string is divided according to rule

Published on 25 Mar 2026 - 7:36

34

Views

Each recursive approximating sequence for Kolmogorov complexity is not uniform

Published on 25 Mar 2026 - 5:43

62

Views

Why $C(n\mid l(n)) \ge C(n) - C(l(n))$ for Kolmogorov complexity

Published on 25 Mar 2026 - 7:44

273

Views

Intuition on Martin-Löf-Test for finite strings

Published on 25 Mar 2026 - 19:06

127

Views

Proof of a classical Theorem of Martin-Löf on complexity dips for Kolmogorov complexity,

Published on 25 Mar 2026 - 9:40

481

Views

The existential theory is undecidable

Published on 30 Mar 2026 - 21:07

257

Views

FRACTRAN for natural numbers

Published on 31 Jul 2015 - 5:42

548

Views

Algorithm to answer existential questions - Reduction

Published on 30 Mar 2026 - 23:19

430

Views

$F[t]$ has undecidable positive existential theory in the language $\{+, \cdot , 0, 1, t\}$

Published on 31 Mar 2026 - 3:31

582

Views

Proving Richardson's theorem for constants

Published on 03 Aug 2015 - 11:58

122

Views

Can Incompleteness be Computable?

Published on 27 Mar 2026 - 16:12

782

Views

Is there a turing machine for which halting is equivalent to the Axiom of Choice or its negation?

Published on 27 Mar 2026 - 16:17

59

Views

The diophantine problem for $R[T]$ is solvable iff the diophantine problem for $R$ is solvable

Published on 09 Aug 2015 - 15:36

List Question

On Kolmogorov complexity of first and last half of a string

Induction Can't Prove Complexity?

Kolmogorov complexity of substring if string is divided according to rule

Each recursive approximating sequence for Kolmogorov complexity is not uniform

Why $C(n\mid l(n)) \ge C(n) - C(l(n))$ for Kolmogorov complexity

Intuition on Martin-Löf-Test for finite strings

Proof of a classical Theorem of Martin-Löf on complexity dips for Kolmogorov complexity,

The existential theory is undecidable

FRACTRAN for natural numbers

Algorithm to answer existential questions - Reduction

$F[t]$ has undecidable positive existential theory in the language $\{+, \cdot , 0, 1, t\}$

Proving Richardson's theorem for constants

Can Incompleteness be Computable?

Is there a turing machine for which halting is equivalent to the Axiom of Choice or its negation?

The diophantine problem for $R[T]$ is solvable iff the diophantine problem for $R$ is solvable

Trending Questions

Popular # Hahtags

Popular Questions