Tag computability - Dit is bladsy 5 - GeneraCodice

For an NFA, can we always find a RAM?

https://www.generacodice.com/af/articolo/2475099/for-an-nfa-can-we-always-find-a-ram
  complexity-theory  -  computability  -  finite-automata  -  discrete-mathematics  -  formal-languages
cs.stackexchange cs.stackexchange

What is minimization (μ-function) in layman tems?

https://www.generacodice.com/af/articolo/2472699/what-is-minimization-μ-function-in-layman-tems
  computability
cs.stackexchange cs.stackexchange

What's wrong with this “proof” that $\mathbb{R}$ is enumerable?

https://www.generacodice.com/af/articolo/2472636/what-s-wrong-with-this-proof-that-mathbb-r-is-enumerable
  enumeration  -  computability  -  real-numbers  -  uncountability
cs.stackexchange cs.stackexchange

Why is this language Turing recognizable and not not-Turing recognizable

https://www.generacodice.com/af/articolo/2472511/why-is-this-language-turing-recognizable-and-not-not-turing-recognizable
  complexity-theory  -  turing-machines  -  computability  -  undecidability
cs.stackexchange cs.stackexchange

Is it true that if L* is recursive, L is also recursive?

https://www.generacodice.com/af/articolo/2472067/is-it-true-that-if-l-is-recursive-l-is-also-recursive
  computability  -  formal-languages  -  kleene-star
cs.stackexchange cs.stackexchange

Confusion of halting problem

https://www.generacodice.com/af/articolo/2471887/confusion-of-halting-problem
  computability  -  halting-problem
cs.stackexchange cs.stackexchange

Computability of Kolmogorov Complexity of Turing-Incomplete language

https://www.generacodice.com/af/articolo/2470144/computability-of-kolmogorov-complexity-of-turing-incomplete-language
  computability  -  kolmogorov-complexity
cs.stackexchange cs.stackexchange

Turing machine that can remember

https://www.generacodice.com/af/articolo/2469201/turing-machine-that-can-remember
  turing-machines  -  computability
cs.stackexchange cs.stackexchange

Proving undecidability for a language which contains string with certain syntax

https://www.generacodice.com/af/articolo/2468930/proving-undecidability-for-a-language-which-contains-string-with-certain-syntax
  turing-machines  -  computability  -  undecidability
cs.stackexchange cs.stackexchange

Is it correct to say L is RE if I can map reduction from LH to L?

https://www.generacodice.com/af/articolo/2468850/is-it-correct-to-say-l-is-re-if-i-can-map-reduction-from-lh-to-l
  computability
cs.stackexchange cs.stackexchange
Resultate gevind: 1630
scroll top