Question

Is there an infinite set of strings whose Kolmogorov complexities are computable?

score 610 · Answer 1 · 2026-03-22 21:53:17

610

Views

Is there an infinite set of strings whose Kolmogorov complexities are computable?

Published on 22 Mar 2026 - 21:53

score 318 · Answer 2 · 2026-03-23 01:04:24

318

Views

How to assess the complexity of a string

Published on 23 Mar 2026 - 1:04

score 2.3k · Answer 3 · 2026-03-23 10:21:37

2.3k

Views

Minimal Turing machines are not recursively enumerable & Kolmogorov complexity is uncomputable

Published on 23 Mar 2026 - 10:21

score 4.5k · Answer 4 · 2026-03-23 10:25:13

4.5k

Views

Proof that the set of incompressible strings is undecidable

Published on 23 Mar 2026 - 10:25

score 6.6k · Answer 5 · 2026-03-23 04:52:49

6.6k

Views

Question about the definition of "Prefix free"

Published on 23 Mar 2026 - 4:52

score 415 · Answer 6 · 2026-03-21 21:38:35

415

Views

The minimal number of states required to run Goldbach's Conjecture

Published on 21 Mar 2026 - 21:38

score 550 · Answer 7 · 2026-03-23 11:18:24

550

Views

Does the $k$th forward difference of Radó's $\Sigma$ eventually dominate every computable function?

Published on 23 Mar 2026 - 11:18

score 329 · Answer 8 · 2026-03-23 00:24:11

329

Views

Solovay Randomness

Published on 23 Mar 2026 - 0:24

score 45 · Answer 9 · 2026-03-23 15:01:42

45

Views

Is it really true that $K(x|y) = K(x,y) - K(y)$?

Published on 23 Mar 2026 - 15:01

score 97 · Answer 10 · 2026-03-22 21:54:03

97

Views

Kolmogorov complexity of sequence and its fragment

Published on 22 Mar 2026 - 21:54

score 76 · Answer 11 · 2026-03-23 15:15:11

76

Views

Respective complexities of a string and its substring

Published on 23 Mar 2026 - 15:15

score 417 · Answer 12 · 2020-08-28 11:07:01

417

Views

The philosophical significance of Chaitin's Theorem

Published on 28 Aug 2020 - 11:07

score 172 · Answer 13 · 2020-08-30 14:26:26

172

Views

How to universalize $\text{Prov}(\ulcorner y < K(x)\urcorner) \to y < K(x)$ in a paper of Kikuchi

Published on 30 Aug 2020 - 14:26

score 198 · Answer 14 · 2020-09-11 13:22:32

198

Views

Recursion theoretic definition of Kolmogorov complexity

Published on 11 Sep 2020 - 13:22

score 248 · Answer 15 · 2020-09-14 23:09:57

248

Views

Formalization in PA in the Kritchman-Raz proof

Published on 14 Sep 2020 - 23:09

List Question

Is there an infinite set of strings whose Kolmogorov complexities are computable?

How to assess the complexity of a string

Minimal Turing machines are not recursively enumerable & Kolmogorov complexity is uncomputable

Proof that the set of incompressible strings is undecidable

Question about the definition of "Prefix free"

The minimal number of states required to run Goldbach's Conjecture

Does the $k$th forward difference of Radó's $\Sigma$ eventually dominate every computable function?

Solovay Randomness

Is it really true that $K(x|y) = K(x,y) - K(y)$?

Kolmogorov complexity of sequence and its fragment

Respective complexities of a string and its substring

The philosophical significance of Chaitin's Theorem

How to universalize $\text{Prov}(\ulcorner y < K(x)\urcorner) \to y < K(x)$ in a paper of Kikuchi

Recursion theoretic definition of Kolmogorov complexity

Formalization in PA in the Kritchman-Raz proof

Trending Questions

Popular # Hahtags

Popular Questions