La dimensione dell'incrocio di 2 lingue Le dimensioni non sono decidabili

Question

Penso che la prossima lingua non sia decidabile ma non riesco a pensare alla riduzione per mostrarlo. Apprezzerei qualche suggerimento o intuizione

$ eq= $ { $ $ | $ M1 \, \, \, e \, \, \, m2 \, \, \, \, m2 \, \, \, \, \, tms \, \, \, \, \, \, \, \, \, \, \, \, \, \, \, \, \, \, \, \, \, \, \, \, \, \, \, \, \, \, \, \, \, \, \, \, \, \, \, \, \, \, \, \, \, \, \, \, \, \, \, \, \, \, \, \, \, \, \, \, \, \, \, \, \, \, \, \, \, \, \, \, \, \, \, tmsL (M1) \, ∩ \, l (m2) \, | \, $$= 2020 \, $ }

Answer 1

Considera un'istanza del problema di interruzione $ \ Langle m, x \ Rangle $ . Costruisci una nuova macchina di Turing che $ M_X $ che accetterà le stringhe $ 0 $ , $ 00 $ , $ 000 \ ldots 0 ^ {2020} $ se la macchina $ M $ si ferma sull'ingresso $ x $ ; E rifiuterà tutte le altre stringhe. Let $ M_U $ Sii il TM che accetta tutte le stringhe.

Convinciti che $ | l (m_x) \ cap l (m_u) | $ sarà 2020 se $ m $ si ferma su $ x $ e altrimenti $ 0 $ .

La prova segue facilmente.

(informale) suggerimento: ogni volta che hai una domanda del genere, prova a pensare a come puoi risolvere il problema di fermezza (o qualche altro linguaggio indecidabile) usando il decisore ipotetico per il linguaggio specificato. .

Answer 2

welcome to the site :)

I assume you already know that the Halting problem $L_H$ is undecidable (as it is usually the first specific undecidable language students learn of). So, let us try and find a reduction $L_H \leq EQ$.

We want to know whether some given TM $M$ halts given the input word $w$ by transforming the pair $\langle M, w \rangle$ to some $EQ$-instance $f(\langle M, w \rangle) = \langle M_1, M_2 \rangle$ such that $\langle M, w \rangle \in L_H$ if and only if $\langle M_1, M_2 \rangle \in EQ$. Let us consider some dummy TM $M_{2020}$ which just accepts 2020 inputs (any set of 2020 words will do the trick) and modify $M_{2020}$ such that it only ever accepts if $M$ halts on $w$ to get another TM $M_{2020}(M, w)$. Since we know $M$ and $w$ when we construct $M_{2020}(M, w)$, we can implement it to do the following:

1. Read the input and if it is one of the 2020 words accepted by $M_{2020}$, make note of that (we can use the states to store this).
2. Clear the tape and write $w$ to it.
3. Run $M$ on $w$.
4. If $M$ halts on $w$, accept the original input.

Such a construction can be performed by another TM, this is a bit tedious to show formally but by noting that we can essentially "embed" $M$ in $M_{2020}(M, w)$ it should be intuitive that this can be done (as $M_{2020}$ is a fixed TM).

Now observe that $M_{2020}(M, w)$ accepts some input $x \in L(M_{2020})$ precisely when $M$ halts on $w$, hence we have that $L(M_{2020}) = L(M_{2020}(M, w))$ if and only if $\langle M, w \rangle \in L_H$, otherwise we have $L(M_{2020}(M, w)) = \emptyset$. It follows that $$ | L(M_{2020}(M, w)) \cap L(M_{2020}) | = \begin{cases} 2020, & \text{if $M$ halts on $w$} \\ 0, & \text{otherwise} \end{cases} $$ and thus (denoting $\langle M_{2020}, M_{2020}(M, w) \rangle$ as $f(\langle M, w \rangle$) we have $\langle M, w \rangle \in L_H \Leftrightarrow f(\langle M, w \rangle)$ and therefore a suitable reduction.

An easier way to prove that the language is not decidable is by using Rice's theorem which (roughly speaking) says that properties of functions computed by TMs (we call these semantic properties) cannot be decided algorithmically unless they are trivial. If we fix some TM $M_1$ and consider an arbitrary TM $M$ then asking whether $L(M_1) \cap L(M)$ has size 2020 is such a semantic property and hence Rice's theorem immediately gives us that $EQ$ is undecidable. The theorem (for me, at least) is basically the formal underpinning of the informal intuition I gave above.