en
italiano
english
français
española
中国
日本の
العربية
Deutsch
한국어
Português
Russian
Full articles
Categories
C#
PHP
PYTHON
JAVA
SQL SERVER
MYSQL
HTML
CSS
JQUERY
VUE
ReactJS
You write
User
Login
Registration
Password recovery
Tags
Language tags
Back-end
C#
PHP
JAVA
PYTHON
Database
Sql server
Mysql
Front-end
HTML
CSS
JQUERY
ANGULARJS
REACT
VUE.JS
Tag semi-decidability - This is page 4 - GeneraCodice
Is it decidable whether a Turing machine M will reach state q on input s?
https://www.generacodice.com/en/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/en/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/en/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/en/articolo/1607617/rec-and-re-under-intersection
turing-machines
-
computability
-
formal-languages
-
undecidability
-
semi-decidability
cs.stackexchange
How do I construct a NTM that accepts the language consisting of the coding of turing machines that halt on one input?
https://www.generacodice.com/en/articolo/1606880/how-do-i-construct-a-ntm-that-accepts-the-language-consisting-of-the-coding-of-turing-machines-that-halt-on-one-input
turing-machines
-
nondeterminism
-
semi-decidability
cs.stackexchange
Is Rice-Shapiro theorem bidirectional?
https://www.generacodice.com/en/articolo/1606871/is-rice-shapiro-theorem-bidirectional
computability
-
semi-decidability
cs.stackexchange
Is the set of context free grammars that generate all words in co-RE?
https://www.generacodice.com/en/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
Whether language of all turing machines is decidable or undecidable or semi-decidable?
https://www.generacodice.com/en/articolo/1605233/whether-language-of-all-turing-machines-is-decidable-or-undecidable-or-semi-decidable
turing-machines
-
computability
-
undecidability
-
semi-decidability
cs.stackexchange
Proving a set is semi-decidable
https://www.generacodice.com/en/articolo/1604256/proving-a-set-is-semi-decidable
turing-machines
-
semi-decidability
cs.stackexchange
Determining if given languages are regular or recursively enumerable
https://www.generacodice.com/en/articolo/1601274/determining-if-given-languages-are-regular-or-recursively-enumerable
formal-languages
-
undecidability
-
regular-languages
-
semi-decidability
cs.stackexchange
«
1
2
3
4
5
6
»
Results found: 173