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 halting-problem - This is page 6 - GeneraCodice
Help with finding a flaw in argument simulating large Turing machines with smaller ones
https://www.generacodice.com/en/articolo/2455433/help-with-finding-a-flaw-in-argument-simulating-large-turing-machines-with-smaller-ones
turing-machines
-
halting-problem
cs.stackexchange
Can we find a Turing machine such that there is no Turing machine to decide whether it halts on $\epsilon$?
https://www.generacodice.com/en/articolo/2450004/can-we-find-a-turing-machine-such-that-there-is-no-turing-machine-to-decide-whether-it-halts-on-epsilon
turing-machines
-
halting-problem
cs.stackexchange
Union of halting-like problem and non-halting-like problem
https://www.generacodice.com/en/articolo/2448797/union-of-halting-like-problem-and-non-halting-like-problem
halting-problem
-
formal-languages
-
undecidability
-
semi-decidability
cs.stackexchange
is the empty language L = ∅ a subset of every languages?
https://www.generacodice.com/en/articolo/2446142/is-the-empty-language-l-a-subset-of-every-languages
halting-problem
-
undecidability
cs.stackexchange
Is checking if the length of a C program that can generate a string is less than a given number decidable?
https://www.generacodice.com/en/articolo/2443763/is-checking-if-the-length-of-a-c-program-that-can-generate-a-string-is-less-than-a-given-number-decidable
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/en/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/en/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/en/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/en/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/en/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
»
Results found: 342