Tag computation-models - Esta é a página 2 - GeneraCodice

Equivalência entre um tm e um tm mutável

https://www.generacodice.com/pt/articolo/2469207/equivalencia-entre-um-tm-e-um-tm-mutavel
  turing-machines  -  computation-models  -  turing-completeness  -  church-turing-thesis
cs.stackexchange cs.stackexchange

Expressar funções usando a aritmética de dicionário

https://www.generacodice.com/pt/articolo/2467152/expressar-funcoes-usando-a-aritmetica-de-dicionario
  turing-machines  -  first-order-logic  -  computation-models
cs.stackexchange cs.stackexchange

Encerramento em idiomas regulares

https://www.generacodice.com/pt/articolo/2457504/encerramento-em-idiomas-regulares
  automata  -  computation-models
cs.stackexchange cs.stackexchange

Complexidade computacional de símbolos de contagem

https://www.generacodice.com/pt/articolo/2455158/complexidade-computacional-de-simbolos-de-contagem
  complexity-theory  -  turing-machines  -  computation-models
cs.stackexchange cs.stackexchange

Modelos de programação paralela: Por que o OpenMP e o MPI dominam?

https://www.generacodice.com/pt/articolo/2453322/modelos-de-programacao-paralela-por-que-o-openmp-e-o-mpi-dominam
  programming-languages  -  message-passing  -  computation-models  -  parallel-computing
cs.stackexchange cs.stackexchange

Are weakly polynomial time algorithms truly polynomial?

https://www.generacodice.com/pt/articolo/2451194/are-weakly-polynomial-time-algorithms-truly-polynomial
  complexity-theory  -  turing-machines  -  algorithms  -  computation-models
cs.stackexchange cs.stackexchange

Would models of computation in other conceivable universes be Turing complete?

https://www.generacodice.com/pt/articolo/2446171/would-models-of-computation-in-other-conceivable-universes-be-turing-complete
  physics  -  computability  -  computation-models
cs.stackexchange cs.stackexchange

Showing the following language is decidable

https://www.generacodice.com/pt/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/pt/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/pt/articolo/1616294/injectivity-verification-in-o-n-space-and-o-n-time
  complexity-theory  -  space-complexity  -  computation-models  -  oracle-machines
cs.stackexchange cs.stackexchange
Resultados encontrados: 386
scroll top