Question

Does the uncomputability of Kolmogorov complexity follows from Rice Theorem?

score 76 · Answer 1 · 2026-03-25 19:04:21

76

Views

Does the uncomputability of Kolmogorov complexity follows from Rice Theorem?

Published on 25 Mar 2026 - 19:04

score 99 · Answer 2 · 2026-04-03 11:06:32

99

Views

Is it true that the domain of this function is finite?

Published on 03 Apr 2026 - 11:06

score 237 · Answer 3 · 2021-02-22 02:33:48

237

Views

Infinite computably enumerable set is the image of a computable $1:1$ function

Published on 22 Feb 2021 - 2:33

score 68 · Answer 4 · 2021-02-22 23:04:25

68

Views

Is this the right notion of "relatively arithmetical"?

Published on 22 Feb 2021 - 23:04

score 158 · Answer 5 · 2026-03-29 19:52:41

158

Views

Why is $f_1(n)$ not computable but $f_2(n)$ is?

Published on 29 Mar 2026 - 19:52

score 45 · Answer 6 · 2021-02-25 11:08:06

45

Views

Construct a recursive set T which does not have an infinite polynomial time computable subset

Published on 25 Feb 2021 - 11:08

score 126 · Answer 7 · 2021-02-26 23:54:59

126

Views

I made one theorem (with proof) does it already exist?

Published on 26 Feb 2021 - 23:54

score 163 · Answer 8 · 2021-02-28 18:06:05

163

Views

Basic questions on Turing degrees and the jump operator

Published on 28 Feb 2021 - 18:06

score 188 · Answer 9 · 2021-02-28 19:29:05

188

Views

The jump operator is well defined on the Turing degrees

Published on 28 Feb 2021 - 19:29

score 647 · Answer 10 · 2026-03-28 00:48:07

647

Views

Intuition behind the construction of a fixed point from Kleene's fixed point theorem

Published on 28 Mar 2026 - 0:48

score 74 · Answer 11 · 2026-04-06 00:47:39

74

Views

An indirect proof of Rice's theorem

Published on 06 Apr 2026 - 0:47

score 53 · Answer 12 · 2021-03-01 03:01:25

53

Views

$\Pi^1_1$ relations have a $\Pi^1_1$ (skolem) choice function

Published on 01 Mar 2021 - 3:01

score 26 · Answer 13 · 2021-03-01 20:57:54

26

Views

What classification does this formula have?

Published on 01 Mar 2021 - 20:57

score 48 · Answer 14 · 2021-03-01 23:48:21

48

Views

Two versions of Kleene's recursion theorem - what's the relationship between them?

Published on 02 Mar 2021 - 19:47

List Question

Does the uncomputability of Kolmogorov complexity follows from Rice Theorem?

Is it true that the domain of this function is finite?

Infinite computably enumerable set is the image of a computable $1:1$ function

Is this the right notion of "relatively arithmetical"?

Why is $f_1(n)$ not computable but $f_2(n)$ is?

Construct a recursive set T which does not have an infinite polynomial time computable subset

I made one theorem (with proof) does it already exist?

Basic questions on Turing degrees and the jump operator

The jump operator is well defined on the Turing degrees

Intuition behind the construction of a fixed point from Kleene's fixed point theorem

An indirect proof of Rice's theorem

$\Pi^1_1$ relations have a $\Pi^1_1$ (skolem) choice function

What classification does this formula have?

More on relative computability in this question

Two versions of Kleene's recursion theorem - what's the relationship between them?

Trending Questions

Popular # Hahtags

Popular Questions