# Search Results

Results tagged with Search options user 42371
5 results

Questions related to computability theory, a.k.a. recursion theory

Let $M_p$ be a TM that decides palindromes with runtime on $x$ at least $|x|$. Given $\langle M \rangle$ construct $\langle M' \rangle$ where $M'$ on $x$ behaves as follows: Run $M$ on $\langle M \r … answered Jan 26 '16 by Denis Pankratov Yes, they are different.$L(M)$is the set of all inputs accepted by a Turing machine, so$E_{TM}$asks if a Turing machine doesn't accept any inputs.$H_0$asks whether a particular input (the empty … answered Feb 7 '16 by Denis Pankratov Given a Turing Machine$M$you can effectively construct$M'$that does the following: Given$x$,$M'$overwrites$x$with$\langle M\rangle$up to length$|x|$or end of$\langle M\rangle$, whichev … answered Jan 25 '16 by Denis Pankratov WLOG assume we are talking about languages over a binary alphabet$\{0,1\}$. Let$M'$be an enumerating Turing Machine for$L$, i.e., every element of$L$is eventually output by$M'$. Let$\langle M_ …
answered May 27 '16 by Denis Pankratov
I am interpreting the word "whenever" in the definition of $T$ to mean that $T$ consists of all pairs $\langle M, w \rangle$ such that either $M$ accepts $w$ and $w^R$ or $M$ rejects $w$ and $w^R$. Pl …
answered Feb 12 '16 by Denis Pankratov