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 1 - GeneraCodice
Is $\{w~|~\forall x \in T(M_v):|w|>|x|~\}$ decidable?
https://www.generacodice.com/en/articolo/2475207/is-w-forall-x-in-t-m-v-w-x-decidable
undecidability
-
semi-decidability
-
decision-problem
cs.stackexchange
Show that for every language there exists a harder language
https://www.generacodice.com/en/articolo/2470979/show-that-for-every-language-there-exists-a-harder-language
turing-machines
-
undecidability
-
semi-decidability
-
reductions
cs.stackexchange
How to prove semi-decidable = verifiable?
https://www.generacodice.com/en/articolo/2468882/how-to-prove-semi-decidable-verifiable
semi-decidability
cs.stackexchange
Semi-decidability of the language $\overline{L_{\epsilon}}$
https://www.generacodice.com/en/articolo/2468452/semi-decidability-of-the-language-overline-l-epsilon
turing-machines
-
halting-problem
-
proof-techniques
-
semi-decidability
cs.stackexchange
“problematic” non-halting inputs for Turing machines
https://www.generacodice.com/en/articolo/2467252/problematic-non-halting-inputs-for-turing-machines
turing-machines
-
semi-decidability
cs.stackexchange
Is reaching in less lines semi-decidable?
https://www.generacodice.com/en/articolo/2466883/is-reaching-in-less-lines-semi-decidable
turing-machines
-
semi-decidability
cs.stackexchange
Union of halting-like problem and non-halting-like problem
https://www.generacodice.com/en/articolo/2448797/union-of-halting-like-problem-and-non-halting-like-problem
halting-problem
-
formal-languages
-
undecidability
-
semi-decidability
cs.stackexchange
Is it possible that the subtraction between two undecidable languages is regular?
https://www.generacodice.com/en/articolo/1810854/is-it-possible-that-the-subtraction-between-two-undecidable-languages-is-regular
turing-machines
-
undecidability
-
regular-languages
-
semi-decidability
cs.stackexchange
Decidability of the language of all deterministic LBA where all states are reachable
https://www.generacodice.com/en/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/en/articolo/1616752/decidability-of-decision-problems
turing-machines
-
undecidability
-
semi-decidability
-
decision-problem
-
rice-theorem
cs.stackexchange
«
1
2
3
4
5
6
»
Results found: 173