N-Sat

Let us continue this discussion in chat.

@Arno Machine moving in loop but how we say "no"?

So you wrote "all of w" means all character of w?

@Arno your first proof definitely wrong. There are infinitely many strings. How can you read all of the strings and reach at the end. And check moving left or not?

@Arno "If neither of these happen, then T will eventually have read all of w"--here all of w means?and how can you say with gurantee T reads all infinite string?

@Arno by your logic emptiness, finiteness also be decidable which is impossible.

@Arno "If neither of these happen, then T will eventually have read all of w and move on to the blank part of the tape to the right of w."--Please explain this statement.

@peter Rice's theorem isn't not applicable on machine property. So Rice's theorem isn't applicable here.

@Peter "If neither of these happen, then T will eventually have read all of w and move on to the blank part of the tape to the right of w."-- could you explain the meaning of this line?

@peter now if you understand, please explain me.

@Arno "If neither of these happen, then T will eventually have read all of w "-- there are infinite many w how can you say T read a of w? I don't understand this line. Please elaborate.

Yes, exactly I mean it

But there are many infinitely many string, how could we check all strings? Here only one string we need to check?

complement of cfl is illegal transcript because it's not closed under complement?

it's my final question believe me. I have understood everything. Please just tell in one line.

Both bulletin {t} is unit set?

complement of cfl is illegal transcript because it's not closed under complement?

I mean $\overline{L(G)} = \{t\}$ isn't single string because complement of cfl isn't closed, it maybe regular, csl etc. That's why it's content also more than one. Am I right?

Yes, first bullet is cfl. But what is the reason behind $\{t\}$ has more than one string?

Why $\overline{L(G)} = \{t\}$ isn't single string for first bullet?

Here you consider $L(G)$ is transcript or language?

means $L(G)$ is collection transcript?

I don't want any proof. I want just what is it. As per my understanding it has illegal state and head location etc. Am I correct?

What is transcript, encoding of TM?

illegal" transcripts means?

That understand. But why $L(G) = \emptyset$ and $L(G)=$ finite is undecidable?

Why determining whether $L(G) = \emptyset$ or whether $L(G)$ is finite is undecidable even for "deterministic context-sensitive languages?

But @Arno takes another logic by taking path which is confusing never heard

There exist w, we need to find w, but there are infinite many string, how can we find w?

You understand second part of answer?

Steven please help.

Steven

Machine moving in loop but how we say "we can answer "no" at the end. "

One thing tell Turing machine always have finite states?

Arno please reply.

Means T has completed read of w?

"T has already completed the loop it will now follow forever. "-- meaning

Almost understand... Just I have1-2 confusion.

@Arno "If neither of these happen, then T will eventually have read all of w"--here all of w means?and how can you say with gurantee T reads all infinite string?

So you wrote "all of w" means all character of w?

@Arno your first proof definitely wrong. There are infinitely many strings. How can you read all of the strings and reach at the end. And check moving left or not?

@Arno by your logic emptiness, finiteness also be decidable which is impossible.

@Peter "If neither of these happen, then T will eventually have read all of w and move on to the blank part of the tape to the right of w."-- could you explain the meaning of this line?

@peter now if you understand, please explain me.

@peter Rice's theorem isn't not applicable on machine property. So Rice's theorem isn't applicable here.

@Arno "If neither of these happen, then T will eventually have read all of w and move on to the blank part of the tape to the right of w."--Please explain this statement.

Yes, exactly I mean it

@Arno "If neither of these happen, then T will eventually have read all of w "-- there are infinite many w how can you say T read a of w? I don't understand this line. Please elaborate.

But there are many infinitely many string, how could we check all strings? Here only one string we need to check?