Question

Given a regular language $L$ and Turing machine $T$, is it decidable that $\mathcal{L}_{acc}(T) \subseteq L$?

score 1.5k · Answer 1 · 2017-12-09 00:34:23

1.5k

Views

Given a regular language $L$ and Turing machine $T$, is it decidable that $\mathcal{L}_{acc}(T) \subseteq L$?

Published on 09 Dec 2017 - 0:34

score 340 · Answer 2 · 2017-12-15 14:53:38

340

Views

Are all geometries complete/consisten/decidable?

Published on 15 Dec 2017 - 14:53

score 228 · Answer 3 · 2017-12-29 22:53:28

228

Views

Is the set {p | Lp is context free} decidable, semidecidable, or not semidecidable?

Published on 29 Dec 2017 - 22:53

score 5k · Answer 4 · 2010-12-29 22:44:00

5k

Views

The word problem for finite groups

Published on 29 Dec 2010 - 22:44

score 3k · Answer 5 · 2011-01-12 12:26:27

3k

Views

Is there a statement whose undecidability is undecidable?

Published on 12 Jan 2011 - 12:26

score 2.6k · Answer 6 · 2011-09-17 09:12:50

2.6k

Views

Are there statements that are undecidable but not provably undecidable

Published on 17 Sep 2011 - 9:12

score 2.3k · Answer 7 · 2012-04-25 10:19:49

2.3k

Views

Is there a decision procedure for intuitionistic propositional logic?

Published on 25 Apr 2012 - 10:19

score 614 · Answer 8 · 2020-07-31 14:27:17

614

Views

An undecidable problem and a non-semidecidable one

Published on 31 Jul 2020 - 14:27

score 38 · Answer 9 · 2020-08-06 10:31:06

38

Views

Is there a "basis" or "subbasis" for semidecidability?

Published on 06 Aug 2020 - 10:31

score 1k · Answer 10 · 2020-08-16 22:13:23

1k

Views

Decidable Languages over an alphabet

Published on 16 Aug 2020 - 22:13

score 182 · Answer 11 · 2020-08-21 11:38:59

182

Views

Prove that: For each language L that is accepted by a DTM in polynomial time, there is also a DTM M′ that decides L in polynomial time.

Published on 21 Aug 2020 - 11:38

score 81 · Answer 12 · 2020-08-31 11:57:56

81

Views

Given a TM T , is there an input string that causes T to enter every one of its nonhalting states?

Published on 31 Aug 2020 - 11:57

score 95 · Answer 13 · 2020-09-09 16:29:29

95

Views

How to disprove that a problem is undecidable

Published on 09 Sep 2020 - 16:29

score 110 · Answer 14 · 2020-09-11 14:14:46

110

Views

How close is "$Y$ is connected" to a $\Sigma^0_1$, or $\Pi^0_1$ sentence?

Published on 11 Sep 2020 - 14:14

score 32 · Answer 15 · 2020-09-17 19:56:48

32

Views

Is the statement $A \leq_{\operatorname{mo}}^{\operatorname{poly}}B \land A\in \operatorname{REC}\implies B\in\operatorname{REC}$ true?

Published on 17 Sep 2020 - 19:56

List Question

Given a regular language $L$ and Turing machine $T$, is it decidable that $\mathcal{L}_{acc}(T) \subseteq L$?

Are all geometries complete/consisten/decidable?

Is the set {p | Lp is context free} decidable, semidecidable, or not semidecidable?

The word problem for finite groups

Is there a statement whose undecidability is undecidable?

Are there statements that are undecidable but not provably undecidable

Is there a decision procedure for intuitionistic propositional logic?

An undecidable problem and a non-semidecidable one

Is there a "basis" or "subbasis" for semidecidability?

Decidable Languages over an alphabet

Prove that: For each language L that is accepted by a DTM in polynomial time, there is also a DTM M′ that decides L in polynomial time.

Given a TM T , is there an input string that causes T to enter every one of its nonhalting states?

How to disprove that a problem is undecidable

How close is "$Y$ is connected" to a $\Sigma^0_1$, or $\Pi^0_1$ sentence?

Is the statement $A \leq_{\operatorname{mo}}^{\operatorname{poly}}B \land A\in \operatorname{REC}\implies B\in\operatorname{REC}$ true?

Trending Questions

Popular # Hahtags

Popular Questions