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 decision-problem - This is page 1 - GeneraCodice
How to convert a decision tree to an automaton?
https://www.generacodice.com/en/articolo/2479078/how-to-convert-a-decision-tree-to-an-automaton
decision-tree
-
automata
-
decision-problem
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
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
Rice's Theorem for Turing machine with fixed output
https://www.generacodice.com/en/articolo/2473617/rice-s-theorem-for-turing-machine-with-fixed-output
turing-machines
-
decision-problem
-
rice-theorem
cs.stackexchange
Why is the Halting problem decidable for Goto languages limited on the highest value of constants and variables?
https://www.generacodice.com/en/articolo/2473164/why-is-the-halting-problem-decidable-for-goto-languages-limited-on-the-highest-value-of-constants-and-variables
halting-problem
-
turing-completeness
-
decision-problem
cs.stackexchange
I have a decision problem with $2^n$ bit sized certificates, how would I verify my decision problem efficiently if it is in $NP$?
https://www.generacodice.com/en/articolo/2472800/i-have-a-decision-problem-with-2-n-bit-sized-certificates-how-would-i-verify-my-decision-problem-efficiently-if-it-is-in-np
decision-problem
cs.stackexchange
Nondeterministic polynomial time algorithm versus certificate/verifier for showing membership in NP
https://www.generacodice.com/en/articolo/2472768/nondeterministic-polynomial-time-algorithm-versus-certificate-verifier-for-showing-membership-in-np
definitions
-
np
-
proof-techniques
-
decision-problem
-
complexity-classes
cs.stackexchange
Every decidable language $L$ has an infinite decidable subset $S \subset L$ such that $L \setminus S$ is infinite
https://www.generacodice.com/en/articolo/2471648/every-decidable-language-l-has-an-infinite-decidable-subset-s-subset-l-such-that-l-setminus-s-is-infinite
turing-machines
-
computation-models
-
decision-problem
cs.stackexchange
Proof of Co-Problem being in NP if Problem is in NP using negated output
https://www.generacodice.com/en/articolo/2471546/proof-of-co-problem-being-in-np-if-problem-is-in-np-using-negated-output
np-complete
-
np
-
decision-problem
cs.stackexchange
Computing automaton for $L(A) / L(B)$ gives ones for $A,B$
https://www.generacodice.com/en/articolo/2471312/computing-automaton-for-l-a-l-b-gives-ones-for-a-b
turing-machines
-
finite-automata
-
decision-problem
cs.stackexchange
«
1
2
3
4
5
6
»
Results found: 400