Etiqueta computation-models - Esta es la página 2 - GeneraCodice

Equivalencia entre un TM y un TM cambiante.

https://www.generacodice.com/es/articolo/2469207/equivalencia-entre-un-tm-y-un-tm-cambiante
  turing-machines  -  computation-models  -  turing-completeness  -  church-turing-thesis
cs.stackexchange cs.stackexchange

Expresando funciones utilizando el diccionario aritmético.

https://www.generacodice.com/es/articolo/2467152/expresando-funciones-utilizando-el-diccionario-aritmetico
  turing-machines  -  first-order-logic  -  computation-models
cs.stackexchange cs.stackexchange

Cierre en idiomas regulares

https://www.generacodice.com/es/articolo/2457504/cierre-en-idiomas-regulares
  automata  -  computation-models
cs.stackexchange cs.stackexchange

Complejidad computacional de conteo de símbolos.

https://www.generacodice.com/es/articolo/2455158/complejidad-computacional-de-conteo-de-simbolos
  complexity-theory  -  turing-machines  -  computation-models
cs.stackexchange cs.stackexchange

Modelos de programación paralelos: ¿Por qué domina OpenMP y MPI?

https://www.generacodice.com/es/articolo/2453322/modelos-de-programacion-paralelos-por-que-domina-openmp-y-mpi
  programming-languages  -  message-passing  -  computation-models  -  parallel-computing
cs.stackexchange cs.stackexchange

Are weakly polynomial time algorithms truly polynomial?

https://www.generacodice.com/es/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/es/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/es/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/es/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/es/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