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

Is $AlwaysHalt$ recursively enumerable?

https://www.generacodice.com/jp/articolo/1527705/is-alwayshalt-recursively-enumerable
  computability  -  halting-problem  -  semi-decidability
cs.stackexchange cs.stackexchange

Is it possible to obtain a total function by composition of partial functions?

https://www.generacodice.com/jp/articolo/1527689/is-it-possible-to-obtain-a-total-function-by-composition-of-partial-functions
  terminology  -  computability  -  semi-decidability
cs.stackexchange cs.stackexchange

How to prove that a language is not recursively enumerable

https://www.generacodice.com/jp/articolo/1527621/how-to-prove-that-a-language-is-not-recursively-enumerable
  computability  -  proof-techniques  -  semi-decidability
cs.stackexchange cs.stackexchange

The Hindley-Milner type system plus polymorphic recursion is undecidable or semidecidable?

https://www.generacodice.com/jp/articolo/1518547/the-hindley-milner-type-system-plus-polymorphic-recursion-is-undecidable-or-semidecidable
  type-inference  -  semi-decidability
cs.stackexchange cs.stackexchange

Can languages with infinite strings be recursively enumerable?

https://www.generacodice.com/jp/articolo/1518000/can-languages-with-infinite-strings-be-recursively-enumerable
  turing-machines  -  computability  -  formal-languages  -  semi-decidability
cs.stackexchange cs.stackexchange

Extension of Rice's theorem

https://www.generacodice.com/jp/articolo/1517678/extension-of-rice-s-theorem
  turing-machines  -  computability  -  undecidability  -  semi-decidability
cs.stackexchange cs.stackexchange

Is there C++ code that takes infinite time to compile?

https://www.generacodice.com/jp/articolo/1496419/is-there-c-code-that-takes-infinite-time-to-compile
  computability  -  compilers  -  semi-decidability
cs.stackexchange cs.stackexchange

Is it possible for a language and its complement to both be unrecognizable?

https://www.generacodice.com/jp/articolo/1494945/is-it-possible-for-a-language-and-its-complement-to-both-be-unrecognizable
  computability  -  semi-decidability
cs.stackexchange cs.stackexchange

Why is the class of recursively enumerable languages not closed under complementation?

https://www.generacodice.com/jp/articolo/1493574/why-is-the-class-of-recursively-enumerable-languages-not-closed-under-complementation
  computability  -  closure-properties  -  semi-decidability
cs.stackexchange cs.stackexchange

Is the set of Gödel numbers of computable constant functions recursively enumerable?

https://www.generacodice.com/jp/articolo/1490613/is-the-set-of-godel-numbers-of-computable-constant-functions-recursively-enumerable
  computability  -  semi-decidability
cs.stackexchange cs.stackexchange
結果が見つかりました: 173
scroll top