标签computation-models - 这是页5 - GeneraCodice

Showing the following language is decidable

https://www.generacodice.com/cn/articolo/1620893/showing-the-following-language-is-decidable
  complexity-theory  -  turing-machines  -  computability  -  automata  -  computation-models
cs.stackexchange cs.stackexchange

Is the graph symbol used in dask a general notation?

https://www.generacodice.com/cn/articolo/1616619/is-the-graph-symbol-used-in-dask-a-general-notation
  computation-models  -  graphs
cs.stackexchange cs.stackexchange

Injectivity verification in o(n) space and O(n) time

https://www.generacodice.com/cn/articolo/1616294/injectivity-verification-in-o-n-space-and-o-n-time
  complexity-theory  -  space-complexity  -  computation-models  -  oracle-machines
cs.stackexchange cs.stackexchange

Difference between multi-tape Turing machine and single tape machine

https://www.generacodice.com/cn/articolo/1615056/difference-between-multi-tape-turing-machine-and-single-tape-machine
  complexity-theory  -  computability  -  time-complexity  -  computation-models
cs.stackexchange cs.stackexchange

Doing matrix multiplication with $\lceil n^3 / \log n \rceil$ processors in $2\log n$ steps by Brent's principle

https://www.generacodice.com/cn/articolo/1609199/doing-matrix-multiplication-with-lceil-n-3-log-n-rceil-processors-in-2-log-n-steps-by-brent-s-principle
  complexity-theory  -  computation-models  -  parallel-computing
cs.stackexchange cs.stackexchange

What is the motivation behind restore model of computation?

https://www.generacodice.com/cn/articolo/1607384/what-is-the-motivation-behind-restore-model-of-computation
  algorithms  -  computation-models
cs.stackexchange cs.stackexchange

Why a TM with infinite states can decide the halting problem?

https://www.generacodice.com/cn/articolo/1607320/why-a-tm-with-infinite-states-can-decide-the-halting-problem
  computability  -  halting-problem  -  computation-models
cs.stackexchange cs.stackexchange

Why do DFAs with a single final state have less power?

https://www.generacodice.com/cn/articolo/1605323/why-do-dfas-with-a-single-final-state-have-less-power
  finite-automata  -  automata  -  computation-models
cs.stackexchange cs.stackexchange

Primitive recursive plus Ackermann

https://www.generacodice.com/cn/articolo/1604359/primitive-recursive-plus-ackermann
  computability  -  computation-models  -  primitive-recursion
cs.stackexchange cs.stackexchange

SIMD computational model

https://www.generacodice.com/cn/articolo/1604215/simd-computational-model
  computation-models
cs.stackexchange cs.stackexchange
发现结果: 386
scroll top