Português
italiano
english
français
española
中国
日本の
العربية
Deutsch
한국어
Português
Russian
Artigos completos
Categorias
C#
PHP
PYTHON
JAVA
SQL SERVER
MYSQL
HTML
CSS
JQUERY
VUE
ReactJS
Você escreve
Do utilizador
Conecte-se
Cadastro
Recuperação de senha
Tag
Tags de idioma
Back-end
C#
PHP
JAVA
PYTHON
Database
Sql server
Mysql
Front-end
HTML
CSS
JQUERY
ANGULARJS
REACT
VUE.JS
Tag reference-question - Esta é a página 2 - GeneraCodice
What is the difference between an algorithm, a language and a problem?
https://www.generacodice.com/pt/articolo/1126243/what-is-the-difference-between-an-algorithm-a-language-and-a-problem
complexity-theory
-
terminology
-
formal-languages
-
algorithms
-
reference-question
cs.stackexchange
How to show that a function is not computable?
https://www.generacodice.com/pt/articolo/1120918/how-to-show-that-a-function-is-not-computable
computability
-
undecidability
-
reference-question
-
proof-techniques
cs.stackexchange
What is the definition of P, NP, NP-complete and NP-hard?
https://www.generacodice.com/pt/articolo/1117981/what-is-the-definition-of-p-np-np-complete-and-np-hard
complexity-theory
-
terminology
-
reference-question
-
p-vs-np
-
complexity-classes
cs.stackexchange
How does the computer determine whether a number is smaller or greater than another?
https://www.generacodice.com/pt/articolo/1110569/how-does-the-computer-determine-whether-a-number-is-smaller-or-greater-than-another
computer-architecture
-
reference-question
cs.stackexchange
How do I write a proof using induction on the length of the input string?
https://www.generacodice.com/pt/articolo/1102588/how-do-i-write-a-proof-using-induction-on-the-length-of-the-input-string
finite-automata
-
automata
-
induction
-
reference-question
-
proof-techniques
cs.stackexchange
How to convert finite automata to regular expressions?
https://www.generacodice.com/pt/articolo/1096340/how-to-convert-finite-automata-to-regular-expressions
finite-automata
-
formal-languages
-
algorithms
-
reference-question
-
regular-expressions
cs.stackexchange
How can we assume that basic operations on numbers take constant time?
https://www.generacodice.com/pt/articolo/1095680/how-can-we-assume-that-basic-operations-on-numbers-take-constant-time
complexity-theory
-
time-complexity
-
algorithms
-
reference-question
-
algorithm-analysis
cs.stackexchange
Dealing with intractability: NP-complete problems
https://www.generacodice.com/pt/articolo/1095319/dealing-with-intractability-np-complete-problems
np-complete
-
algorithms
-
efficiency
-
reference-question
-
reference-request
cs.stackexchange
How to prove a language is regular?
https://www.generacodice.com/pt/articolo/1095039/how-to-prove-a-language-is-regular
automata
-
formal-languages
-
reference-question
-
regular-languages
-
proof-techniques
cs.stackexchange
How to prove that a language is not regular?
https://www.generacodice.com/pt/articolo/1093375/how-to-prove-that-a-language-is-not-regular
formal-languages
-
reference-question
-
regular-languages
-
proof-techniques
cs.stackexchange
«
1
2
3
»
Resultados encontrados: 30