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 church-turing-thesis - Esta é a página 1 - GeneraCodice
Parar problema para máquinas de turing com uma entrada
https://www.generacodice.com/pt/articolo/2477858/parar-problema-para-maquinas-de-turing-com-uma-entrada
turing-machines
-
church-turing-thesis
cs.stackexchange
É o languague L={<M>, M aceita uma quantidade finita de palavras} decdidable?
https://www.generacodice.com/pt/articolo/2472944/e-o-languague-l-m-m-aceita-uma-quantidade-finita-de-palavras-decdidable
turing-machines
-
undecidability
-
church-turing-thesis
cs.stackexchange
Equivalência entre um tm e um tm mutável
https://www.generacodice.com/pt/articolo/2469207/equivalencia-entre-um-tm-e-um-tm-mutavel
turing-machines
-
computation-models
-
turing-completeness
-
church-turing-thesis
cs.stackexchange
About computable sets
https://www.generacodice.com/pt/articolo/2464272/about-computable-sets
turing-machines
-
computability
-
discrete-mathematics
-
undecidability
-
church-turing-thesis
cs.stackexchange
Algumas perguntas sobre a computabilidade das máquinas Turing
https://www.generacodice.com/pt/articolo/2443418/algumas-perguntas-sobre-a-computabilidade-das-maquinas-turing
turing-machines
-
church-turing-thesis
cs.stackexchange
Can current quantum computers decide languages that Turing Machines cannot?
https://www.generacodice.com/pt/articolo/1809438/can-current-quantum-computers-decide-languages-that-turing-machines-cannot
turing-machines
-
quantum-computing
-
undecidability
-
reductions
-
church-turing-thesis
cs.stackexchange
Turing machine where the next step is determined by the state and the symbols up to the read/write head
https://www.generacodice.com/pt/articolo/1615292/turing-machine-where-the-next-step-is-determined-by-the-state-and-the-symbols-up-to-the-read-write-head
complexity-theory
-
turing-machines
-
church-turing-thesis
cs.stackexchange
How to come up with a language that is recognizable but not co-recognizable?
https://www.generacodice.com/pt/articolo/1613406/how-to-come-up-with-a-language-that-is-recognizable-but-not-co-recognizable
turing-machines
-
church-turing-thesis
cs.stackexchange
Does this article imply that Turing-Computability is not the same as “effectively computable”?
https://www.generacodice.com/pt/articolo/1612429/does-this-article-imply-that-turing-computability-is-not-the-same-as-effectively-computable
turing-machines
-
quantum-computing
-
church-turing-thesis
cs.stackexchange
Is turing completeness related to recursive enumerable languages?
https://www.generacodice.com/pt/articolo/1610927/is-turing-completeness-related-to-recursive-enumerable-languages
turing-machines
-
turing-completeness
-
church-turing-thesis
cs.stackexchange
«
1
2
3
4
5
6
»
Resultados encontrados: 67