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 9 - GeneraCodice
Semidecidability/Decidability for strings seperated by a non alphabet symbol
https://www.generacodice.com/en/articolo/1581689/semidecidability-decidability-for-strings-seperated-by-a-non-alphabet-symbol
turing-machines
-
undecidability
-
semi-decidability
cs.stackexchange
Given language consisting Turing machines is decidable or not?
https://www.generacodice.com/en/articolo/1580052/given-language-consisting-turing-machines-is-decidable-or-not
turing-machines
-
computability
-
undecidability
-
semi-decidability
-
reductions
cs.stackexchange
Showing an equivalent definition of $CO-RE$
https://www.generacodice.com/en/articolo/1579888/showing-an-equivalent-definition-of-co-re
computability
-
semi-decidability
cs.stackexchange
Partial recursive function with no total recursive extension
https://www.generacodice.com/en/articolo/1579844/partial-recursive-function-with-no-total-recursive-extension
computability
-
semi-decidability
cs.stackexchange
Language of TMs that accept some x in less than 50 steps. Is it in co-RE?
https://www.generacodice.com/en/articolo/1578903/language-of-tms-that-accept-some-x-in-less-than-50-steps-is-it-in-co-re
turing-machines
-
computability
-
semi-decidability
cs.stackexchange
Does it matter for this function if the set we check membership of is finite?
https://www.generacodice.com/en/articolo/1574113/does-it-matter-for-this-function-if-the-set-we-check-membership-of-is-finite
computability
-
semi-decidability
-
mu-recursion
cs.stackexchange
Dovetailing in Turing Machines?
https://www.generacodice.com/en/articolo/1573941/dovetailing-in-turing-machines
turing-machines
-
undecidability
-
semi-decidability
cs.stackexchange
Is the set of pairs of TMs at least one of which accepts the empty word semi-deciable?
https://www.generacodice.com/en/articolo/1573517/is-the-set-of-pairs-of-tms-at-least-one-of-which-accepts-the-empty-word-semi-deciable
computability
-
undecidability
-
semi-decidability
cs.stackexchange
Language of TMs such that one state is visited most often
https://www.generacodice.com/en/articolo/1568538/language-of-tms-such-that-one-state-is-visited-most-often
turing-machines
-
computability
-
undecidability
-
semi-decidability
cs.stackexchange
Showing undecidability
https://www.generacodice.com/en/articolo/1563987/showing-undecidability
turing-machines
-
computability
-
undecidability
-
semi-decidability
-
reductions
cs.stackexchange
«
6
7
8
9
10
11
»
Results found: 173