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 13 - GeneraCodice
Is the language of TMs that decide some language Turing-recognizable?
https://www.generacodice.com/en/articolo/1560395/is-the-language-of-tms-that-decide-some-language-turing-recognizable
turing-machines
-
computability
-
semi-decidability
cs.stackexchange
Proving that a language of Turing machine descriptions is/is not Turing recognizable
https://www.generacodice.com/en/articolo/1560341/proving-that-a-language-of-turing-machine-descriptions-is-is-not-turing-recognizable
computability
-
semi-decidability
cs.stackexchange
Does applying a homomorphism to the intersection of two CSLs yield RE languages?
https://www.generacodice.com/en/articolo/1559440/does-applying-a-homomorphism-to-the-intersection-of-two-csls-yield-re-languages
formal-languages
-
closure-properties
-
semi-decidability
-
context-sensitive
cs.stackexchange
How to show that the set of TMs that accept languages of size two is recognizable?
https://www.generacodice.com/en/articolo/1559431/how-to-show-that-the-set-of-tms-that-accept-languages-of-size-two-is-recognizable
turing-machines
-
computability
-
semi-decidability
cs.stackexchange
undecidable problem and its negation is undecidable
https://www.generacodice.com/en/articolo/1549485/undecidable-problem-and-its-negation-is-undecidable
turing-machines
-
computability
-
formal-languages
-
undecidability
-
semi-decidability
cs.stackexchange
Is the superset and subset of a semi-decidable language also semi-decidable? [duplicate]
https://www.generacodice.com/en/articolo/1548417/is-the-superset-and-subset-of-a-semi-decidable-language-also-semi-decidable-duplicate
semi-decidability
cs.stackexchange
Showing that the set of DTMs that run forever is not Turing-recognizable
https://www.generacodice.com/en/articolo/1548176/showing-that-the-set-of-dtms-that-run-forever-is-not-turing-recognizable
turing-machines
-
computability
-
halting-problem
-
semi-decidability
cs.stackexchange
Symmetric Difference of Turing Recognizable and Finite Languages
https://www.generacodice.com/en/articolo/1547501/symmetric-difference-of-turing-recognizable-and-finite-languages
computability
-
formal-languages
-
closure-properties
-
semi-decidability
cs.stackexchange
A and B are Turing recognizable, is A - B Turing recognizable?
https://www.generacodice.com/en/articolo/1546229/a-and-b-are-turing-recognizable-is-a-b-turing-recognizable
computability
-
closure-properties
-
semi-decidability
cs.stackexchange
Why is it true that the relation R and its negation are not semi decidable?
https://www.generacodice.com/en/articolo/1544682/why-is-it-true-that-the-relation-r-and-its-negation-are-not-semi-decidable
computability
-
halting-problem
-
undecidability
-
semi-decidability
cs.stackexchange
«
10
11
12
13
14
15
»
Results found: 173