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 oracle-machines - Esta é a página 6 - GeneraCodice
What does it mean for a problem to be solved in polynomial time “relative to” an oracle?
https://www.generacodice.com/pt/articolo/1584798/what-does-it-mean-for-a-problem-to-be-solved-in-polynomial-time-relative-to-an-oracle
complexity-theory
-
terminology
-
quantum-computing
-
probabilistic-algorithms
-
oracle-machines
cs.stackexchange
Are all proof techniques which only look at black box behaviour of a TM relativizing?
https://www.generacodice.com/pt/articolo/1584467/are-all-proof-techniques-which-only-look-at-black-box-behaviour-of-a-tm-relativizing
complexity-theory
-
turing-machines
-
proof-techniques
-
relativization
-
oracle-machines
cs.stackexchange
Why can't we simulate an NP oracle with an NP machine?
https://www.generacodice.com/pt/articolo/1581745/why-can-t-we-simulate-an-np-oracle-with-an-np-machine
complexity-theory
-
turing-machines
-
time-complexity
-
np
-
oracle-machines
cs.stackexchange
Existence of suitable pseudo-random number generators to derandomize BPP to P
https://www.generacodice.com/pt/articolo/1581699/existence-of-suitable-pseudo-random-number-generators-to-derandomize-bpp-to-p
complexity-theory
-
pseudo-random-generators
-
randomized-algorithms
-
oracle-machines
cs.stackexchange
If a language is not Turing reducible to two languages, may it still be Turing reducible to their “union”?
https://www.generacodice.com/pt/articolo/1580563/if-a-language-is-not-turing-reducible-to-two-languages-may-it-still-be-turing-reducible-to-their-union
turing-machines
-
undecidability
-
oracle-machines
cs.stackexchange
Proving that the halting problem is not Turing-reducible to the acceptance problem for Turing machines
https://www.generacodice.com/pt/articolo/1580561/proving-that-the-halting-problem-is-not-turing-reducible-to-the-acceptance-problem-for-turing-machines
turing-machines
-
undecidability
-
oracle-machines
cs.stackexchange
Can a Turing machine be both decidable and undecidable relative to itself?
https://www.generacodice.com/pt/articolo/1580540/can-a-turing-machine-be-both-decidable-and-undecidable-relative-to-itself
turing-machines
-
undecidability
-
oracle-machines
cs.stackexchange
Superscript on complexity class?
https://www.generacodice.com/pt/articolo/1579404/superscript-on-complexity-class
complexity-theory
-
np
-
oracle-machines
cs.stackexchange
Is this language in $PSPACE^{L'}$?
https://www.generacodice.com/pt/articolo/1578650/is-this-language-in-pspace-l
complexity-theory
-
turing-machines
-
oracle-machines
cs.stackexchange
Countably many oracle Turing machines?
https://www.generacodice.com/pt/articolo/1578135/countably-many-oracle-turing-machines
complexity-theory
-
turing-machines
-
oracle-machines
cs.stackexchange
«
3
4
5
6
7
8
»
Resultados encontrados: 107