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 2 - GeneraCodice
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
Why is this language Turing recognizable and not not-Turing recognizable
https://www.generacodice.com/en/articolo/2472511/why-is-this-language-turing-recognizable-and-not-not-turing-recognizable
complexity-theory
-
turing-machines
-
computability
-
undecidability
cs.stackexchange
Help me understand this Turing-machine Problem concerning $A_{TM}$
https://www.generacodice.com/en/articolo/2470996/help-me-understand-this-turing-machine-problem-concerning-a-tm
turing-machines
-
undecidability
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
Proving undecidability for a language which contains string with certain syntax
https://www.generacodice.com/en/articolo/2468930/proving-undecidability-for-a-language-which-contains-string-with-certain-syntax
turing-machines
-
computability
-
undecidability
cs.stackexchange
«
1
2
3
4
5
6
»
Results found: 685