Question

Decidability of DCFL and Undecidability of CFL with respect to regularity

score 460 · Answer 1 · 2026-02-24 02:08:47

460

Views

Decidability of DCFL and Undecidability of CFL with respect to regularity

Published on 24 Feb 2026 - 2:08

score 1.4k · Answer 2 · 2026-02-24 02:02:36

1.4k

Views

Why is "Turing machine makes no left move" decidable?

Published on 24 Feb 2026 - 2:02

score 65 · Answer 3 · 2026-02-23 15:04:36

65

Views

Must every Turing-complete language be able to enumerate precisely those algorithms which return a particular value?

Published on 23 Feb 2026 - 15:04

score 675 · Answer 4 · 2026-02-24 02:05:41

675

Views

Show the projection of decidable language is Turing-recognizable

Published on 24 Feb 2026 - 2:05

score 387 · Answer 5 · 2021-11-10 08:33:53

387

Views

TM that cannot write on the portion of the tape containing the input string recognizes only regular language

Published on 10 Nov 2021 - 8:33

score 379 · Answer 6 · 2026-02-24 02:05:40

379

Views

Simple concrete example of a language that is Turing recognizable but not decidable

Published on 24 Feb 2026 - 2:05

score 3.5k · Answer 7 · 2026-02-24 03:35:50

3.5k

Views

Every infinite Turing-recognizable language has an infinite decidable subset

Published on 24 Feb 2026 - 3:35

score 205 · Answer 8 · 2021-11-11 15:35:01

205

Views

Why can't I use a polynomial-time reduction for proving P-completeness?

Published on 11 Nov 2021 - 15:35

score 211 · Answer 9 · 2021-11-14 13:10:33

211

Views

Group input string by 4 characters by adding " " with a Turing Machine

Published on 14 Nov 2021 - 13:10

score 160 · Answer 10 · 2021-11-15 13:25:25

160

Views

Are there countably many symbols (in the context of computation theory)?

Published on 15 Nov 2021 - 13:25

score 277 · Answer 11 · 2026-02-24 03:35:43

277

Views

Proof that the Post Correspondence Problem is undecidable

Published on 24 Feb 2026 - 3:35

score 297 · Answer 12 · 2026-02-23 15:02:12

297

Views

Multitape Turing Machine - Check input's primality

Published on 23 Feb 2026 - 15:02

score 130 · Answer 13 · 2026-02-24 03:38:04

130

Views

Using diagonalization approach, how to show the existence of at least one set of natural numbers that is not computable?

Published on 24 Feb 2026 - 3:38

score 174 · Answer 14 · 2026-03-26 11:07:07

174

Views

Lower bound for $bb(7)$ - which one is true ? And what is the bound for $bb(6,3)$?

Published on 26 Mar 2026 - 11:07

score 33 · Answer 15 · 2021-12-17 01:10:32

33

Views

About Turing machine. what is Turing machine of $\lfloor n/2\rfloor$?

Published on 17 Dec 2021 - 1:10

List Question

Decidability of DCFL and Undecidability of CFL with respect to regularity

Why is "Turing machine makes no left move" decidable?

Must every Turing-complete language be able to enumerate precisely those algorithms which return a particular value?

Show the projection of decidable language is Turing-recognizable

TM that cannot write on the portion of the tape containing the input string recognizes only regular language

Simple concrete example of a language that is Turing recognizable but not decidable

Every infinite Turing-recognizable language has an infinite decidable subset

Why can't I use a polynomial-time reduction for proving P-completeness?

Group input string by 4 characters by adding " " with a Turing Machine

Are there countably many symbols (in the context of computation theory)?

Proof that the Post Correspondence Problem is undecidable

Multitape Turing Machine - Check input's primality

Using diagonalization approach, how to show the existence of at least one set of natural numbers that is not computable?

Lower bound for $bb(7)$ - which one is true ? And what is the bound for $bb(6,3)$?

About Turing machine. what is Turing machine of $\lfloor n/2\rfloor$?

Trending Questions

Popular # Hahtags

Popular Questions