Tag turing-machines - This is page 197 - GeneraCodice

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

Proving that recursively enumerable languages are closed against taking prefixes

https://www.generacodice.com/en/articolo/1095840/proving-that-recursively-enumerable-languages-are-closed-against-taking-prefixes

turing-machines - formal-languages - closure-properties

cs.stackexchange

Turing reducibility implies mapping reducibility

https://www.generacodice.com/en/articolo/1095496/turing-reducibility-implies-mapping-reducibility

turing-machines - computability - reductions

cs.stackexchange

The space complexity of recognising Watson-Crick palindromes

https://www.generacodice.com/en/articolo/1094851/the-space-complexity-of-recognising-watson-crick-palindromes

turing-machines - space-complexity - algorithms - algorithm-analysis

cs.stackexchange

Are there minimum criteria for a programming language being Turing complete?

https://www.generacodice.com/en/articolo/1093263/are-there-minimum-criteria-for-a-programming-language-being-turing-complete

turing-machines - programming-languages - computability - turing-completeness

cs.stackexchange

Are Turing machines more powerful than pushdown automata?

https://www.generacodice.com/en/articolo/1092469/are-turing-machines-more-powerful-than-pushdown-automata

turing-machines - computability - automata - formal-languages - pushdown-automata

cs.stackexchange

A Question relating to a Turing Machine with a useless state

https://www.generacodice.com/en/articolo/1092405/a-question-relating-to-a-turing-machine-with-a-useless-state

turing-machines - formal-methods - computability - undecidability

cs.stackexchange

Decidablity of Languages of Grammars and Automata

https://www.generacodice.com/en/articolo/1092384/decidablity-of-languages-of-grammars-and-automata

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

cs.stackexchange

How to define quantum Turing machines?

https://www.generacodice.com/en/articolo/1091224/how-to-define-quantum-turing-machines

turing-machines - quantum-computing - computation-models

cs.stackexchange

Results found: 2028