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 undecidability - This is page 5 - GeneraCodice
Decidability of Turing machines that never move their heads past any input string
https://www.generacodice.com/en/articolo/2465509/decidability-of-turing-machines-that-never-move-their-heads-past-any-input-string
turing-machines
-
computability
-
undecidability
cs.stackexchange
Decidability of equality, and soundness of expressions involving elementary arithmetic and exponentials
https://www.generacodice.com/en/articolo/2465430/decidability-of-equality-and-soundness-of-expressions-involving-elementary-arithmetic-and-exponentials
computability
-
equality
-
number-theory
-
undecidability
cs.stackexchange
Halting problem theory vs. practice
https://www.generacodice.com/en/articolo/2464468/halting-problem-theory-vs-practice
programming-languages
-
computability
-
halting-problem
-
undecidability
cs.stackexchange
About computable sets
https://www.generacodice.com/en/articolo/2464272/about-computable-sets
turing-machines
-
computability
-
discrete-mathematics
-
undecidability
-
church-turing-thesis
cs.stackexchange
How could you “solve” the halting problem if, hypothetically, the busy beaver numbers were “small”?
https://www.generacodice.com/en/articolo/2462542/how-could-you-solve-the-halting-problem-if-hypothetically-the-busy-beaver-numbers-were-small
turing-machines
-
computability
-
halting-problem
-
undecidability
cs.stackexchange
Difference between regular grammar and CFG in generating computation histories and $\Sigma^*$
https://www.generacodice.com/en/articolo/2459293/difference-between-regular-grammar-and-cfg-in-generating-computation-histories-and-sigma
turing-machines
-
formal-languages
-
formal-grammars
-
undecidability
-
context-free
cs.stackexchange
Is it decidable for a NPDA to halt?
https://www.generacodice.com/en/articolo/2458993/is-it-decidable-for-a-npda-to-halt
turing-machines
-
undecidability
-
pushdown-automata
cs.stackexchange
Halting problem for fixed Turing machine and fixed input
https://www.generacodice.com/en/articolo/2457906/halting-problem-for-fixed-turing-machine-and-fixed-input
turing-machines
-
computability
-
halting-problem
-
undecidability
cs.stackexchange
show that this decidable set $C$ exists
https://www.generacodice.com/en/articolo/2454714/show-that-this-decidable-set-c-exists
turing-machines
-
computability
-
undecidability
cs.stackexchange
show that in every infinite computably enumerable set, there exists an infinite decidable set
https://www.generacodice.com/en/articolo/2454574/show-that-in-every-infinite-computably-enumerable-set-there-exists-an-infinite-decidable-set
turing-machines
-
computability
-
undecidability
cs.stackexchange
«
2
3
4
5
6
7
»
Results found: 685