Question

Do the Robinson and/or Peano arithmetics suffice to prove that the Halting problem is undecidable?

score 209 · Answer 1 · 2026-02-23 22:50:49

209

Views

Do the Robinson and/or Peano arithmetics suffice to prove that the Halting problem is undecidable?

Published on 23 Feb 2026 - 22:50

score 61 · Answer 2 · 2021-02-18 22:30:36

61

Views

Attempted proof of undecidability of halting problem

Published on 18 Feb 2021 - 22:30

score 157 · Answer 3 · 2021-02-24 10:33:15

157

Views

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

Published on 24 Feb 2021 - 10:33

score 1.4k · Answer 4 · 2021-03-13 02:23:59

1.4k

Views

Prove that the set of Turing-decidable languages are closed under union.

Published on 13 Mar 2021 - 2:23

score 662 · Answer 5 · 2021-03-13 03:16:15

662

Views

Prove that the set of Turing-decidable languages are closed under reversal.

Published on 13 Mar 2021 - 3:16

score 443 · Answer 6 · 2021-03-22 04:04:32

443

Views

Determining whether a language $L_{a}$ is recursively enumerable.

Published on 22 Mar 2021 - 4:04

score 436 · Answer 7 · 2026-03-28 08:49:34

436

Views

How to provide a regular grammar equivalent to context-free grammar?

Published on 28 Mar 2026 - 8:49

score 231 · Answer 8 · 2021-03-31 13:55:09

231

Views

Why does the unsolvabililty of the Halting Problem imply the unsolvability of the Entscheidungsproblem?

Published on 31 Mar 2021 - 13:55

score 47 · Answer 9 · 2021-04-03 02:27:15

47

Views

What is the meaning of "w describes a halting TM" mean?

Published on 03 Apr 2021 - 2:27

score 121 · Answer 10 · 2021-04-09 17:00:07

121

Views

Can we avoid some uses of Church-Turing Thesis, by building "interpreters"?

Published on 09 Apr 2021 - 17:00

score 265 · Answer 11 · 2021-04-10 16:05:09

265

Views

Turing machine representing words having as many $0$ as $1$

Published on 10 Apr 2021 - 16:05

score 2k · Answer 12 · 2021-04-11 07:38:20

2k

Views

Design a turing machine for addition of binary number

Published on 11 Apr 2021 - 7:38

score 94 · Answer 13 · 2026-02-24 00:39:37

94

Views

Subtile misunderstanding about Recognizable vs Decidable

Published on 24 Feb 2026 - 0:39

score 824 · Answer 14 · 2026-02-24 00:43:27

824

Views

Let M be a Turing machine. Prove that it is decidable whether M, on a given input w, moves left at least 2021 times.

Published on 24 Feb 2026 - 0:43

score 72 · Answer 15 · 2021-04-14 12:24:47

72

Views

How do I find what kind of language is expressed by the following sets?

Published on 14 Apr 2021 - 12:24

List Question

Do the Robinson and/or Peano arithmetics suffice to prove that the Halting problem is undecidable?

Attempted proof of undecidability of halting problem

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

Prove that the set of Turing-decidable languages are closed under union.

Prove that the set of Turing-decidable languages are closed under reversal.

Determining whether a language $L_{a}$ is recursively enumerable.

How to provide a regular grammar equivalent to context-free grammar?

Why does the unsolvabililty of the Halting Problem imply the unsolvability of the Entscheidungsproblem?

What is the meaning of "w describes a halting TM" mean?

Can we avoid some uses of Church-Turing Thesis, by building "interpreters"?

Turing machine representing words having as many $0$ as $1$

Design a turing machine for addition of binary number

Subtile misunderstanding about Recognizable vs Decidable

Let M be a Turing machine. Prove that it is decidable whether M, on a given input w, moves left at least 2021 times.

How do I find what kind of language is expressed by the following sets?

Trending Questions

Popular # Hahtags

Popular Questions