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 3 - GeneraCodice
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
Is a 'discrete language' well-defined?
https://www.generacodice.com/en/articolo/2468573/is-a-discrete-language-well-defined
discrete-mathematics
-
formal-languages
-
undecidability
cs.stackexchange
Is $nHALT$ undecidable even if $M$ halts on input $w$ in finite steps
https://www.generacodice.com/en/articolo/2468107/is-nhalt-undecidable-even-if-m-halts-on-input-w-in-finite-steps
complexity-theory
-
turing-machines
-
undecidability
cs.stackexchange
Decide if a language has a word of a given size
https://www.generacodice.com/en/articolo/2466712/decide-if-a-language-has-a-word-of-a-given-size
computability
-
formal-languages
-
undecidability
cs.stackexchange
Decidability of Turing machines that never move their heads past any input string
https://www.generacodice.com/en/articolo/2465509/decidability-of-turing-machines-that-never-move-their-heads-past-any-input-string
turing-machines
-
computability
-
undecidability
cs.stackexchange
«
1
2
3
4
5
6
»
Results found: 685