标签semi-decidability - 这是页5 - GeneraCodice

Is the set of context free grammars that generate all words in co-RE?

https://www.generacodice.com/cn/articolo/1605803/is-the-set-of-context-free-grammars-that-generate-all-words-in-co-re
  turing-machines  -  formal-languages  -  context-free  -  semi-decidability
cs.stackexchange cs.stackexchange

Whether language of all turing machines is decidable or undecidable or semi-decidable?

https://www.generacodice.com/cn/articolo/1605233/whether-language-of-all-turing-machines-is-decidable-or-undecidable-or-semi-decidable
  turing-machines  -  computability  -  undecidability  -  semi-decidability
cs.stackexchange cs.stackexchange

Proving a set is semi-decidable

https://www.generacodice.com/cn/articolo/1604256/proving-a-set-is-semi-decidable
  turing-machines  -  semi-decidability
cs.stackexchange cs.stackexchange

Determining if given languages are regular or recursively enumerable

https://www.generacodice.com/cn/articolo/1601274/determining-if-given-languages-are-regular-or-recursively-enumerable
  formal-languages  -  undecidability  -  regular-languages  -  semi-decidability
cs.stackexchange cs.stackexchange

When does an extendible 1:1 p.c. function have a 1:1 computable extension?

https://www.generacodice.com/cn/articolo/1598914/when-does-an-extendible-1-1-p-c-function-have-a-1-1-computable-extension
  computability  -  semi-decidability
cs.stackexchange cs.stackexchange

If Q1 and Q2 are countably enumerable, then is Q1\Q2 countably enumerable?

https://www.generacodice.com/cn/articolo/1598826/if-q1-and-q2-are-countably-enumerable-then-is-q1-q2-countably-enumerable
  computability  -  semi-decidability
cs.stackexchange cs.stackexchange

What is the difference between undecidable language and Turing Recognizable language?

https://www.generacodice.com/cn/articolo/1595581/what-is-the-difference-between-undecidable-language-and-turing-recognizable-language
  computability  -  undecidability  -  semi-decidability
cs.stackexchange cs.stackexchange

Does the language of TM's that repeat a configuration infinite times semi-decidable or not?

https://www.generacodice.com/cn/articolo/1594001/does-the-language-of-tm-s-that-repeat-a-configuration-infinite-times-semi-decidable-or-not
  computability  -  formal-languages  -  undecidability  -  semi-decidability  -  reductions
cs.stackexchange cs.stackexchange

Prove that an infinite set is semidecidible

https://www.generacodice.com/cn/articolo/1592483/prove-that-an-infinite-set-is-semidecidible
  turing-machines  -  semi-decidability
cs.stackexchange cs.stackexchange

Completeness problem of TM

https://www.generacodice.com/cn/articolo/1591307/completeness-problem-of-tm
  turing-machines  -  computability  -  semi-decidability
cs.stackexchange cs.stackexchange
发现结果: 173
scroll top