Question

Can you disprove this counterexample to the diagonal lemma?

score 65 · Answer 1 · 2026-04-06 21:15:10

65

Views

Can you disprove this counterexample to the diagonal lemma?

Published on 06 Apr 2026 - 21:15

score 120 · Answer 2 · 2022-05-01 04:27:43

120

Views

Is there a particular Turing Machine whose halting is independent even from Gödel propositions of ZFC?

Published on 01 May 2022 - 4:27

score 201 · Answer 3 · 2026-03-29 12:40:27

201

Views

Is there a particular Turing Machine which halting is undecidable in all formal systems?

Published on 29 Mar 2026 - 12:40

score 167 · Answer 4 · 2026-04-02 00:44:13

167

Views

Externalizing Statements about the Effective Topos (or: what is it good for?)

Published on 02 Apr 2026 - 0:44

score 118 · Answer 5 · 2026-03-30 06:15:35

118

Views

Is the set of Turing Machines decidable in ZFC non-recursive?

Published on 30 Mar 2026 - 6:15

score 184 · Answer 6 · 2026-03-30 06:10:55

184

Views

Is there some kind of equivalence between Turing Machines and a formal system of axioms?

Published on 30 Mar 2026 - 6:10

score 180 · Answer 7 · 2026-03-30 06:11:54

180

Views

Turing Machines independent of ZFC

Published on 30 Mar 2026 - 6:11

score 104 · Answer 8 · 2026-04-07 03:20:21

104

Views

Definitions of nice recursive analogues of cofinality?

Published on 07 Apr 2026 - 3:20

score 75 · Answer 9 · 2026-03-26 16:04:09

75

Views

Is Kleene's realizability recursive?

Published on 26 Mar 2026 - 16:04

score 220 · Answer 10 · 2022-05-18 12:13:28

220

Views

Why this partial function is not computable?

Published on 18 May 2022 - 12:13

score 358 · Answer 11 · 2026-03-30 06:07:11

358

Views

Halting problem reduction, what am i doing wrong

Published on 30 Mar 2026 - 6:07

score 78 · Answer 12 · 2026-03-30 06:14:29

78

Views

Polynomial time reduction from a language not in $\mathcal{NP}$

Published on 30 Mar 2026 - 6:14

score 72 · Answer 13 · 2026-03-30 08:03:01

72

Views

Are the sets of non-computable functions for different Turing-complete systems equivalent in some sense?

Published on 30 Mar 2026 - 8:03

score 51 · Answer 14 · 2022-06-02 19:16:13

51

Views

Finding a reordering of the non-recursive sequence in computable metric space such that it is a recursive squence.

Published on 02 Jun 2022 - 19:16

score 110 · Answer 15 · 2022-06-03 10:06:20

110

Views

How to convert a function problem into an equally difficult decision problem?

Published on 03 Jun 2022 - 10:06

List Question

Can you disprove this counterexample to the diagonal lemma?

Is there a particular Turing Machine whose halting is independent even from Gödel propositions of ZFC?

Is there a particular Turing Machine which halting is undecidable in all formal systems?

Externalizing Statements about the Effective Topos (or: what is it good for?)

Is the set of Turing Machines decidable in ZFC non-recursive?

Is there some kind of equivalence between Turing Machines and a formal system of axioms?

Turing Machines independent of ZFC

Definitions of nice recursive analogues of cofinality?

Is Kleene's realizability recursive?

Why this partial function is not computable?

Halting problem reduction, what am i doing wrong

Polynomial time reduction from a language not in $\mathcal{NP}$

Are the sets of non-computable functions for different Turing-complete systems equivalent in some sense?

Finding a reordering of the non-recursive sequence in computable metric space such that it is a recursive squence.

How to convert a function problem into an equally difficult decision problem?

Trending Questions

Popular # Hahtags

Popular Questions