Question

Are all infinite sets of indices of computable functions extensional?

score 188 · Answer 1 · 2026-03-22 04:29:43

188

Views

Are all infinite sets of indices of computable functions extensional?

Published on 22 Mar 2026 - 4:29

score 727 · Answer 2 · 2026-03-22 12:46:37

727

Views

Simple applications of forcing in recursion theory?

Published on 22 Mar 2026 - 12:46

score 196 · Answer 3 · 2026-03-22 13:22:57

196

Views

Proof of "Extension" for Rice's Theorem

Published on 22 Mar 2026 - 13:22

score 87 · Answer 4 · 2026-03-22 22:16:20

87

Views

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

Published on 22 Mar 2026 - 22:16

score 93 · Answer 5 · 2026-03-22 19:04:22

93

Views

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

Published on 22 Mar 2026 - 19:04

score 657 · Answer 6 · 2026-03-21 23:10:31

657

Views

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

Published on 21 Mar 2026 - 23:10

score 57 · Answer 7 · 2026-03-20 07:30:18

57

Views

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

Published on 20 Mar 2026 - 7:30

score 157 · Answer 8 · 2026-03-22 19:44:20

157

Views

The elementary theory of finite commutative rings

Published on 22 Mar 2026 - 19:44

score 133 · Answer 9 · 2026-03-19 20:49:19

133

Views

Is there any universal algorithm converting grammar to Turing Machine?

Published on 19 Mar 2026 - 20:49

score 261 · Answer 10 · 2026-03-22 12:56:51

261

Views

Is the sign of a real number decidable?

Published on 22 Mar 2026 - 12:56

score 73 · Answer 11 · 2026-03-24 22:01:58

73

Views

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

Published on 24 Mar 2026 - 22:01

score 2.8k · Answer 12 · 2026-03-20 05:12:43

2.8k

Views

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

Published on 20 Mar 2026 - 5:12

score 119 · Answer 13 · 2026-03-23 06:25:37

119

Views

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

Published on 23 Mar 2026 - 6:25

score 1.8k · Answer 14 · 2026-03-23 08:13:10

1.8k

Views

Semi-decidability of First Order Logic

Published on 23 Mar 2026 - 8:13

score 407 · Answer 15 · 2026-03-22 16:24:41

407

Views

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

Published on 22 Mar 2026 - 16:24

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