Question

Are all infinite sets of indices of computable functions extensional?

score 199 · Answer 1 · 2026-05-02 23:55:05

199

Views

Are all infinite sets of indices of computable functions extensional?

Published on 02 May 2026 - 23:55

score 734 · Answer 2 · 2026-04-29 12:28:56

734

Views

Simple applications of forcing in recursion theory?

Published on 29 Apr 2026 - 12:28

score 216 · Answer 3 · 2026-05-07 10:07:10

216

Views

Proof of "Extension" for Rice's Theorem

Published on 07 May 2026 - 10:07

score 93 · Answer 4 · 2026-05-02 18:30:49

93

Views

How to interpret Matiyasevich–Robinson–Davis–Putnam in term of algebraic geometry or geometry?

Published on 02 May 2026 - 18:30

score 104 · Answer 5 · 2026-05-07 14:11:00

104

Views

Does there exist a weakly increasing cofinal function $\kappa \to \kappa$ strictly below the diagonal?

Published on 07 May 2026 - 14:11

score 667 · Answer 6 · 2026-05-02 18:20:10

667

Views

Why isn't the idea of "an oracle for the halting problem" considered self-contradictory?

Published on 02 May 2026 - 18:20

score 66 · Answer 7 · 2026-05-02 18:46:51

66

Views

is there any set membership of which is not decidable in polynomial time but semidecidable in P?

Published on 02 May 2026 - 18:46

score 167 · Answer 8 · 2026-05-07 06:23:59

167

Views

The elementary theory of finite commutative rings

Published on 07 May 2026 - 6:23

score 142 · Answer 9 · 2026-05-07 17:03:34

142

Views

Is there any universal algorithm converting grammar to Turing Machine?

Published on 07 May 2026 - 17:03

score 270 · Answer 10 · 2026-04-29 12:20:03

270

Views

Is the sign of a real number decidable?

Published on 29 Apr 2026 - 12:20

score 78 · Answer 11 · 2026-04-25 10:59:06

78

Views

Question Regarding Subsets of $\mathbb{N}$ with Certain Properties

Published on 25 Apr 2026 - 10:59

score 2.8k · Answer 12 · 2026-05-03 05:54:48

2.8k

Views

Turing machine to replace consecutive 1's with 0's

Published on 03 May 2026 - 5:54

score 124 · Answer 13 · 2026-05-10 12:55:17

124

Views

if $L \notin RE$ and $L' \notin RE$ then $L \cup L' \notin RE$

Published on 10 May 2026 - 12:55

score 1.8k · Answer 14 · 2026-05-10 12:53:29

1.8k

Views

Semi-decidability of First Order Logic

Published on 10 May 2026 - 12:53

score 412 · Answer 15 · 2026-05-10 12:52:55

412

Views

Is generating a Turing Machine that output a given string $s$ in NP?

Published on 10 May 2026 - 12:52

List Question

Are all infinite sets of indices of computable functions extensional?

Simple applications of forcing in recursion theory?

Proof of "Extension" for Rice's Theorem

How to interpret Matiyasevich–Robinson–Davis–Putnam in term of algebraic geometry or geometry?

Does there exist a weakly increasing cofinal function $\kappa \to \kappa$ strictly below the diagonal?

Why isn't the idea of "an oracle for the halting problem" considered self-contradictory?

is there any set membership of which is not decidable in polynomial time but semidecidable in P?

The elementary theory of finite commutative rings

Is there any universal algorithm converting grammar to Turing Machine?

Is the sign of a real number decidable?

Question Regarding Subsets of $\mathbb{N}$ with Certain Properties

Turing machine to replace consecutive 1's with 0's

if $L \notin RE$ and $L' \notin RE$ then $L \cup L' \notin RE$

Semi-decidability of First Order Logic

Is generating a Turing Machine that output a given string $s$ in NP?

Trending Questions

Popular # Hahtags

Popular Questions