Question

Are all finite sets of numbers decidable?

score 1k · Answer 1 · 2020-08-26 01:26:10

1k

Views

Are all finite sets of numbers decidable?

Published on 26 Aug 2020 - 1:26

score 126 · Answer 2 · 2026-03-28 19:30:47

126

Views

Does Gödel’s theorem preclude the existence of all means of proving all statements in a formal system, or preclude only computable means?

Published on 28 Mar 2026 - 19:30

score 269 · Answer 3 · 2020-08-28 00:39:32

269

Views

Enumerating the Primitive Recursive Functions

Published on 28 Aug 2020 - 0:39

score 82 · Answer 4 · 2026-02-23 19:24:02

82

Views

Given a TM T , is there an input string that causes T to enter every one of its nonhalting states?

Published on 23 Feb 2026 - 19:24

score 41 · Answer 5 · 2020-08-31 13:46:19

41

Views

Showing that a function is primitively recursive

Published on 31 Aug 2020 - 13:46

score 70 · Answer 6 · 2026-03-28 08:48:08

70

Views

$P$ vs $NP$ characterization confusion

Published on 28 Mar 2026 - 8:48

score 1.4k · Answer 7 · 2026-03-28 16:13:31

1.4k

Views

What is the meaning of $\omega$ in the lambda calculus?

Published on 28 Mar 2026 - 16:13

score 233 · Answer 8 · 2026-02-23 08:26:46

233

Views

Equivalent formulations of analytic/ $\omega$-suslin sets (in Baire Space)

Published on 23 Feb 2026 - 8:26

score 139 · Answer 9 · 2026-02-23 08:24:57

139

Views

Recursive representation of closed sets in Baire Space ($\Sigma^1_1$)

Published on 23 Feb 2026 - 8:24

score 60 · Answer 10 · 2020-09-09 18:22:43

60

Views

Does First Incompleteness Theorem imply Strong Undecidability in general?

Published on 09 Sep 2020 - 18:22

score 199 · Answer 11 · 2026-03-25 14:21:04

199

Views

Recursion theoretic definition of Kolmogorov complexity

Published on 25 Mar 2026 - 14:21

score 67 · Answer 12 · 2026-02-23 04:51:21

67

Views

Confusion regarding Computability and Recursion

Published on 23 Feb 2026 - 4:51

score 107 · Answer 13 · 2020-09-20 18:11:45

107

Views

Condition for a set not being simple

Published on 20 Sep 2020 - 18:11

score 133 · Answer 14 · 2026-02-23 21:16:43

133

Views

Prove the decidability of an enumerable set. A and B are enumerable, C is decidable.

Published on 23 Feb 2026 - 21:16

score 130 · Answer 15 · 2026-02-23 21:17:30

130

Views

Prove decidability. Sets A and B. B is finite (have inite number of elements), A is undecidable. Can $A$ $cup$ $B$ be decidable?

Published on 23 Feb 2026 - 21:17

List Question

Are all finite sets of numbers decidable?

Does Gödel’s theorem preclude the existence of all means of proving all statements in a formal system, or preclude only computable means?

Enumerating the Primitive Recursive Functions

Given a TM T , is there an input string that causes T to enter every one of its nonhalting states?

Showing that a function is primitively recursive

$P$ vs $NP$ characterization confusion

What is the meaning of $\omega$ in the lambda calculus?

Equivalent formulations of analytic/ $\omega$-suslin sets (in Baire Space)

Recursive representation of closed sets in Baire Space ($\Sigma^1_1$)

Does First Incompleteness Theorem imply Strong Undecidability in general?

Recursion theoretic definition of Kolmogorov complexity

Confusion regarding Computability and Recursion

Condition for a set not being simple

Prove the decidability of an enumerable set. A and B are enumerable, C is decidable.

Prove decidability. Sets A and B. B is finite (have inite number of elements), A is undecidable. Can $A$ $cup$ $B$ be decidable?

Trending Questions

Popular # Hahtags

Popular Questions