タグsemi-decidability - これはページ6です - GeneraCodice

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

https://www.generacodice.com/jp/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/jp/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/jp/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/jp/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/jp/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/jp/articolo/1591307/completeness-problem-of-tm
  turing-machines  -  computability  -  semi-decidability
cs.stackexchange cs.stackexchange

If a problem is “not semi-decidable” and “not decidable” can we say it is “undecidable”?

https://www.generacodice.com/jp/articolo/1591281/if-a-problem-is-not-semi-decidable-and-not-decidable-can-we-say-it-is-undecidable
  undecidability  -  semi-decidability
cs.stackexchange cs.stackexchange

Enumerable disjoint subsets whose union is equal to the union of the sets

https://www.generacodice.com/jp/articolo/1589440/enumerable-disjoint-subsets-whose-union-is-equal-to-the-union-of-the-sets
  computability  -  semi-decidability
cs.stackexchange cs.stackexchange

Are there any countable sets that are not computably enumerable?

https://www.generacodice.com/jp/articolo/1589214/are-there-any-countable-sets-that-are-not-computably-enumerable
  computability  -  semi-decidability
cs.stackexchange cs.stackexchange

The Church-Turing-Thesis in proofs

https://www.generacodice.com/jp/articolo/1588550/the-church-turing-thesis-in-proofs
  turing-machines  -  computability  -  proof-techniques  -  semi-decidability  -  church-turing-thesis
cs.stackexchange cs.stackexchange
結果が見つかりました: 173
scroll top