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 undecidability - This is page 1 - GeneraCodice
Cannot understand reductions from the halting problem and its complement
https://www.generacodice.com/en/articolo/2477097/cannot-understand-reductions-from-the-halting-problem-and-its-complement
turing-machines
-
undecidability
cs.stackexchange
Is this Language decidable?
https://www.generacodice.com/en/articolo/2477036/is-this-language-decidable
turing-machines
-
undecidability
cs.stackexchange
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
Union of every language within group of decidable languages is also decidable?
https://www.generacodice.com/en/articolo/2475172/union-of-every-language-within-group-of-decidable-languages-is-also-decidable
halting-problem
-
undecidability
-
finite-sets
cs.stackexchange
Why is the following language undecidable?
https://www.generacodice.com/en/articolo/2475052/why-is-the-following-language-undecidable
turing-machines
-
undecidability
-
rice-theorem
cs.stackexchange
Is the problem that determines whenever the word member $\in$ L(M) decidable or not?
https://www.generacodice.com/en/articolo/2474814/is-the-problem-that-determines-whenever-the-word-member-in-l-m-decidable-or-not
turing-machines
-
formal-languages
-
undecidability
-
decision-problem
cs.stackexchange
Is the Post Correspondence Problem with more than two rows harder than the standard two-row variant?
https://www.generacodice.com/en/articolo/2473581/is-the-post-correspondence-problem-with-more-than-two-rows-harder-than-the-standard-two-row-variant
undecidability
cs.stackexchange
Proof of the undecidability of compiler code optimization
https://www.generacodice.com/en/articolo/2473423/proof-of-the-undecidability-of-compiler-code-optimization
undecidability
-
compilers
cs.stackexchange
What undecidable language $B$ is reducible to its complement?
https://www.generacodice.com/en/articolo/2472961/what-undecidable-language-b-is-reducible-to-its-complement
turing-machines
-
undecidability
-
reductions
cs.stackexchange
Is the languague L={<M>, M accepts a finite amount of words} decdidable?
https://www.generacodice.com/en/articolo/2472944/is-the-languague-l-m-m-accepts-a-finite-amount-of-words-decdidable
turing-machines
-
undecidability
-
church-turing-thesis
cs.stackexchange
«
1
2
3
4
5
6
»
Results found: 685