Status Updates From Introduction to the Theory ...

"After all, showing that a problem is unsolvable doesn’t appear to be of any use if you have to solve it. You need to study this phenomenon for two reasons. First, ... because ... you realize that the problem must be simplified ... before you can find an algorithmic solution. The second reason is cultural. a glimpse of the unsolvable can stimulate your imagination and ... you gain ... perspective on computation."

The topics of this book that are the fuzziest is chapters 4 and 5: Decidability and Reducibility.

I will just take my time through these chapters to understand this concept, which is critically important for this field of Computer Science.

[Just realized I was not posting the actual page number. This post is of the actual page number]

"The Turing machine model uses an infinite tape as its unlimited memory."

I think this playlist will cover much of Part 2,

https://www.youtube.com/playlist?list...

Pretty much understand the basic idea. Love the rigor through the use of proofs (something that I can refer back to). So, Part 2 is a known concept for me. Just that I cannot build out the proofs out of my head and, even, if I practice to do so, may not remember after a while.

"Certain languages are more easily described in terms of generators, whereas others are more easily described by recognizers."

I think because of written a programming language already, I understand the detailed logical constructs of doing so.

I guess that I want to grasp all the mathematical minutiae ... which may not be necessary and required unless I need these mathematical tools to solve a very difficult niche problem that has never been solved before.

Short stop to organize review as part of reading list.

Trying to figure what Σε references

Back at "Formal Definition of a Nondeterministic Finite Automaton"

Now at page 45 of the book at Theorem 1.25

Tremendous help from Neso Academy, https://www.youtube.com/playlist?list...