日本の
italiano
english
français
española
中国
日本の
العربية
Deutsch
한국어
Português
Russian
完全な記事
カテゴリ
C#
PHP
PYTHON
JAVA
SQL SERVER
MYSQL
HTML
CSS
JQUERY
VUE
ReactJS
あなたが書く
ユーザー
ログイン
登録
パスワードの復元
タグ
言語タグ
Back-end
C#
PHP
JAVA
PYTHON
Database
Sql server
Mysql
Front-end
HTML
CSS
JQUERY
ANGULARJS
REACT
VUE.JS
タグsemi-decidability - これはページ3です - GeneraCodice
Decidability of the language of all deterministic LBA where all states are reachable
https://www.generacodice.com/jp/articolo/1620653/decidability-of-the-language-of-all-deterministic-lba-where-all-states-are-reachable
formal-languages
-
semi-decidability
-
linear-bounded-automata
cs.stackexchange
Decidability of decision problems
https://www.generacodice.com/jp/articolo/1616752/decidability-of-decision-problems
turing-machines
-
undecidability
-
semi-decidability
-
decision-problem
-
rice-theorem
cs.stackexchange
Turing Machine equivalence in MinTM proof
https://www.generacodice.com/jp/articolo/1615215/turing-machine-equivalence-in-mintm-proof
recursion
-
turing-machines
-
semi-decidability
cs.stackexchange
Is a language whose Turing Machine doesn't halt for some positive cases but for others does not recursive?
https://www.generacodice.com/jp/articolo/1615048/is-a-language-whose-turing-machine-doesn-t-halt-for-some-positive-cases-but-for-others-does-not-recursive
turing-machines
-
computability
-
undecidability
-
semi-decidability
cs.stackexchange
Is $ L = \{ a^n\ |\ a^n \not\in L_n \} $ Turing recognizable (recursively enumerable)?
https://www.generacodice.com/jp/articolo/1613715/is-l-a-n-a-n-not-in-l-n-turing-recognizable-recursively-enumerable
turing-machines
-
undecidability
-
semi-decidability
cs.stackexchange
Recognizably turing machine question (reject / loop)
https://www.generacodice.com/jp/articolo/1613567/recognizably-turing-machine-question-reject-loop
turing-machines
-
semi-decidability
cs.stackexchange
Is it decidable whether a Turing machine M will reach state q on input s?
https://www.generacodice.com/jp/articolo/1609368/is-it-decidable-whether-a-turing-machine-m-will-reach-state-q-on-input-s
turing-machines
-
computability
-
undecidability
-
semi-decidability
cs.stackexchange
Prove the languages |L<M>| = 2 and |L<M>| $\not=$ 2 to be non-Turing recognizable or non-recursively enumerable
https://www.generacodice.com/jp/articolo/1609164/prove-the-languages-l-m-2-and-l-m-not-2-to-be-non-turing-recognizable-or-non-recursively-enumerable
turing-machines
-
computability
-
semi-decidability
-
reductions
cs.stackexchange
Prove Halting on all Inputs is not in RE simulation
https://www.generacodice.com/jp/articolo/1607925/prove-halting-on-all-inputs-is-not-in-re-simulation
turing-machines
-
computability
-
simulation
-
proof-techniques
-
semi-decidability
cs.stackexchange
REC and RE under intersection
https://www.generacodice.com/jp/articolo/1607617/rec-and-re-under-intersection
turing-machines
-
computability
-
formal-languages
-
undecidability
-
semi-decidability
cs.stackexchange
«
1
2
3
4
5
6
»
結果が見つかりました: 173