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 proof-techniques - This is page 50 - GeneraCodice
Do undecidable languages exist in constructivist logic?
https://www.generacodice.com/en/articolo/1123823/do-undecidable-languages-exist-in-constructivist-logic
logic
-
turing-machines
-
formal-languages
-
undecidability
-
proof-techniques
cs.stackexchange
MAX 10-SAT Algorithm
https://www.generacodice.com/en/articolo/1122948/max-10-sat-algorithm
dynamic-programming
-
algorithms
-
proof-techniques
cs.stackexchange
Prove that $L_1$ is regular if $L_2$, $L_1L_2$, $L_2L_1$ are regular
https://www.generacodice.com/en/articolo/1122021/prove-that-l-1-is-regular-if-l-2-l-1l-2-l-2l-1-are-regular
finite-automata
-
regular-languages
-
closure-properties
-
proof-techniques
cs.stackexchange
How to show that a function is not computable?
https://www.generacodice.com/en/articolo/1120918/how-to-show-that-a-function-is-not-computable
computability
-
undecidability
-
reference-question
-
proof-techniques
cs.stackexchange
A pumping lemma for deterministic context-free languages?
https://www.generacodice.com/en/articolo/1120459/a-pumping-lemma-for-deterministic-context-free-languages
pumping-lemma
-
context-free
-
proof-techniques
cs.stackexchange
How to prove NP-hardness of a longest-path problem?
https://www.generacodice.com/en/articolo/1120076/how-to-prove-np-hardness-of-a-longest-path-problem
complexity-theory
-
np-hard
-
proof-techniques
-
reductions
cs.stackexchange
Proving non-confluency and adding an equation to make it confluent and terminating
https://www.generacodice.com/en/articolo/1118924/proving-non-confluency-and-adding-an-equation-to-make-it-confluent-and-terminating
logic
-
semantics
-
proof-techniques
-
term-rewriting
cs.stackexchange
Proof-sketch on the language accepted by a Turing machine
https://www.generacodice.com/en/articolo/1118819/proof-sketch-on-the-language-accepted-by-a-turing-machine
turing-machines
-
formal-languages
-
proof-techniques
cs.stackexchange
How to apply the pumping lemma to $\{0^m 1^n \mid 2n \leq m \leq 3n, m,n \geq 0 \}$?
https://www.generacodice.com/en/articolo/1118805/how-to-apply-the-pumping-lemma-to-0-m-1-n-mid-2n-leq-m-leq-3n-m-n-geq-0
pumping-lemma
-
regular-languages
-
proof-techniques
cs.stackexchange
How do I explain that a polynomial time reduction is in fact polynomial time?
https://www.generacodice.com/en/articolo/1118479/how-do-i-explain-that-a-polynomial-time-reduction-is-in-fact-polynomial-time
complexity-theory
-
np-complete
-
proof-techniques
-
reductions
cs.stackexchange
«
47
48
49
50
51
52
»
Results found: 577