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 halting-problem - Esta é a página 6 - GeneraCodice
Ajuda para encontrar uma falha no argumento simulando grandes máquinas de Turing com máquinas menores
https://www.generacodice.com/pt/articolo/2455433/ajuda-para-encontrar-uma-falha-no-argumento-simulando-grandes-maquinas-de-turing-com-maquinas-menores
turing-machines
-
halting-problem
cs.stackexchange
Podemos encontrar uma máquina de Turing tal que não há máquina de Turing para decidir se ele pára em $ \ epsilon $?
https://www.generacodice.com/pt/articolo/2450004/podemos-encontrar-uma-maquina-de-turing-tal-que-nao-ha-maquina-de-turing-para-decidir-se-ele-para-em-epsilon
turing-machines
-
halting-problem
cs.stackexchange
Union of halting-like problem and non-halting-like problem
https://www.generacodice.com/pt/articolo/2448797/union-of-halting-like-problem-and-non-halting-like-problem
halting-problem
-
formal-languages
-
undecidability
-
semi-decidability
cs.stackexchange
é a linguagem vazia l= ∅ um subconjunto de todos os idiomas?
https://www.generacodice.com/pt/articolo/2446142/e-a-linguagem-vazia-l-um-subconjunto-de-todos-os-idiomas
halting-problem
-
undecidability
cs.stackexchange
Está verificando se o comprimento de um programa C que pode gerar uma string é menor que um determinado número decidível?
https://www.generacodice.com/pt/articolo/2443763/esta-verificando-se-o-comprimento-de-um-programa-c-que-pode-gerar-uma-string-e-menor-que-um-determinado-numero-decidivel
computability
-
halting-problem
-
undecidability
cs.stackexchange
Turing recognizable but not Turing decidable language cannot have TM do not halt on infinitely many inputs
https://www.generacodice.com/pt/articolo/1809104/turing-recognizable-but-not-turing-decidable-language-cannot-have-tm-do-not-halt-on-infinitely-many-inputs
turing-machines
-
automata
-
halting-problem
-
formal-languages
-
undecidability
cs.stackexchange
I want to know where there is the flaw in my argument
https://www.generacodice.com/pt/articolo/1620676/i-want-to-know-where-there-is-the-flaw-in-my-argument
turing-machines
-
halting-problem
-
undecidability
-
reductions
cs.stackexchange
Why is it not possible to prove that two Turing Machines calculate the same function?
https://www.generacodice.com/pt/articolo/1620606/why-is-it-not-possible-to-prove-that-two-turing-machines-calculate-the-same-function
turing-machines
-
halting-problem
-
formal-languages
-
undecidability
cs.stackexchange
Busy-Beaver-like question for WHILE-Programs (Theoretical CS)
https://www.generacodice.com/pt/articolo/1620581/busy-beaver-like-question-for-while-programs-theoretical-cs
computability
-
halting-problem
-
busy-beaver
cs.stackexchange
Since the halting problem is undecidable, does that mean that there exists an always undecidable program?
https://www.generacodice.com/pt/articolo/1616595/since-the-halting-problem-is-undecidable-does-that-mean-that-there-exists-an-always-undecidable-program
turing-machines
-
halting-problem
-
undecidability
cs.stackexchange
«
3
4
5
6
7
8
»
Resultados encontrados: 342