Tag computation-models - This is page 1 - GeneraCodice

Regularity of a language constructed from a know regular language

https://www.generacodice.com/en/articolo/2477946/regularity-of-a-language-constructed-from-a-know-regular-language
  finite-automata  -  computation-models  -  regular-languages  -  closure-properties
cs.stackexchange cs.stackexchange

Every decidable language $L$ has an infinite decidable subset $S \subset L$ such that $L \setminus S$ is infinite

https://www.generacodice.com/en/articolo/2471648/every-decidable-language-l-has-an-infinite-decidable-subset-s-subset-l-such-that-l-setminus-s-is-infinite
  turing-machines  -  computation-models  -  decision-problem
cs.stackexchange cs.stackexchange

Equivalence between a TM and a changing TM

https://www.generacodice.com/en/articolo/2469207/equivalence-between-a-tm-and-a-changing-tm
  turing-machines  -  computation-models  -  turing-completeness  -  church-turing-thesis
cs.stackexchange cs.stackexchange

Expressing functions using the arithmetic dictionary

https://www.generacodice.com/en/articolo/2467152/expressing-functions-using-the-arithmetic-dictionary
  turing-machines  -  first-order-logic  -  computation-models
cs.stackexchange cs.stackexchange

Closure on regular languages

https://www.generacodice.com/en/articolo/2457504/closure-on-regular-languages
  automata  -  computation-models
cs.stackexchange cs.stackexchange

Computational complexity of counting symbols

https://www.generacodice.com/en/articolo/2455158/computational-complexity-of-counting-symbols
  complexity-theory  -  turing-machines  -  computation-models
cs.stackexchange cs.stackexchange

Parallel programming models: Why do OpenMP and MPI dominate?

https://www.generacodice.com/en/articolo/2453322/parallel-programming-models-why-do-openmp-and-mpi-dominate
  programming-languages  -  message-passing  -  computation-models  -  parallel-computing
cs.stackexchange cs.stackexchange

Are weakly polynomial time algorithms truly polynomial?

https://www.generacodice.com/en/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/en/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/en/articolo/1620893/showing-the-following-language-is-decidable
  complexity-theory  -  turing-machines  -  computability  -  automata  -  computation-models
cs.stackexchange cs.stackexchange
Results found: 386
scroll top