Tag turing-machines - This is page 196 - GeneraCodice

What is the difference between quantum TM and nondetermistic TM?

https://www.generacodice.com/en/articolo/1097584/what-is-the-difference-between-quantum-tm-and-nondetermistic-tm

turing-machines - computability - quantum-computing - nondeterminism

cs.stackexchange

Time complexity version of the Church-Turing Thesis

https://www.generacodice.com/en/articolo/1097347/time-complexity-version-of-the-church-turing-thesis

turing-machines - terminology - computability - church-turing-thesis

cs.stackexchange

Why is Turing completeness right?

https://www.generacodice.com/en/articolo/1097156/why-is-turing-completeness-right

turing-machines - computability - history

cs.stackexchange

Can the encodings set of a non-trivial class of languages which contains the empty set be recursively enumerable?

https://www.generacodice.com/en/articolo/1096832/can-the-encodings-set-of-a-non-trivial-class-of-languages-which-contains-the-empty-set-be-recursively-enumerable

turing-machines - computability

cs.stackexchange

Turing Recognisable => enumerable

https://www.generacodice.com/en/articolo/1096749/turing-recognisable-enumerable

turing-machines - computability - intuition

cs.stackexchange

Turing machine and language decidability

https://www.generacodice.com/en/articolo/1096709/turing-machine-and-language-decidability

turing-machines - computability

cs.stackexchange

Show that the halting problem is decidable for one-pass Turing machines

https://www.generacodice.com/en/articolo/1096692/show-that-the-halting-problem-is-decidable-for-one-pass-turing-machines

turing-machines - computability - formal-languages - check-my-proof

cs.stackexchange

Space bounded Turing Machine - clarification on Computational Complexity (book: Arora-Barak ) question 4.1

https://www.generacodice.com/en/articolo/1096506/space-bounded-turing-machine-clarification-on-computational-complexity-book-arora-barak-question-4-1

complexity-theory - turing-machines - terminology - space-complexity

cs.stackexchange

Proof that $\{⟨M⟩ ∣ L(M) \mbox{ is context-free} \}$ is not (co-)recursively enumerable

https://www.generacodice.com/en/articolo/1096284/proof-that-m-l-m-mbox-is-context-free-is-not-co-recursively-enumerable

turing-machines - computability - formal-languages - context-free

cs.stackexchange

$L(M) = L$ where $M$ is a $TM$ that moves only to the right side so $L$ is regular

https://www.generacodice.com/en/articolo/1095930/l-m-l-where-m-is-a-tm-that-moves-only-to-the-right-side-so-l-is-regular

turing-machines - computability - formal-languages - computation-models - regular-languages

cs.stackexchange

Results found: 2028