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 turing-machines - This is page 195 - GeneraCodice
Time complexity version of the Church-Turing Thesis
https://www.generacodice.com/en/articolo/1097347/time-complexity-version-of-the-church-turing-thesis
turing-machines
-
terminology
-
computability
-
church-turing-thesis
cs.stackexchange
What is the difference between quantum TM and nondetermistic TM?
https://www.generacodice.com/en/articolo/1097584/what-is-the-difference-between-quantum-tm-and-nondetermistic-tm
turing-machines
-
computability
-
quantum-computing
-
nondeterminism
cs.stackexchange
Does a never-halting machine always loop?
https://www.generacodice.com/en/articolo/1097592/does-a-never-halting-machine-always-loop
turing-machines
-
computability
-
halting-problem
cs.stackexchange
Is a push-down automaton with two stacks equivalent to a turing machine?
https://www.generacodice.com/en/articolo/1097781/is-a-push-down-automaton-with-two-stacks-equivalent-to-a-turing-machine
turing-machines
-
computability
-
automata
-
pushdown-automata
cs.stackexchange
Universal simulation of Turing machines
https://www.generacodice.com/en/articolo/1097859/universal-simulation-of-turing-machines
complexity-theory
-
turing-machines
-
simulation
-
reference-request
-
machine-models
cs.stackexchange
Why does NTIME consider the length of the longest computation?
https://www.generacodice.com/en/articolo/1097870/why-does-ntime-consider-the-length-of-the-longest-computation
complexity-theory
-
turing-machines
-
terminology
-
time-complexity
-
nondeterminism
cs.stackexchange
Counting with constant space bounded TMs
https://www.generacodice.com/en/articolo/1097951/counting-with-constant-space-bounded-tms
turing-machines
-
finite-automata
-
space-complexity
-
regular-languages
-
streaming-algorithm
cs.stackexchange
Showing that the set of TMs which visit the starting state twice on the empty input is undecidable
https://www.generacodice.com/en/articolo/1098004/showing-that-the-set-of-tms-which-visit-the-starting-state-twice-on-the-empty-input-is-undecidable
turing-machines
-
halting-problem
-
undecidability
-
reductions
cs.stackexchange
Is it decidable whether a TM reaches some position on the tape?
https://www.generacodice.com/en/articolo/1098267/is-it-decidable-whether-a-tm-reaches-some-position-on-the-tape
turing-machines
-
computability
-
undecidability
cs.stackexchange
Is #P closed under exponentiation? modulo?
https://www.generacodice.com/en/articolo/1098305/is-p-closed-under-exponentiation-modulo
complexity-theory
-
turing-machines
-
closure-properties
cs.stackexchange
«
192
193
194
195
196
197
»
Results found: 2028