Hi! I am Satin Wuker, an open source enthusiast, theory pursuer, and …
(I don’t like limiting myself using natural language). I will succinctly present
you my new “discoveries” on the land of the Theory of Computation, in an easy-to-understand way.

WHY TOC?

The reason I started reading the theories of computation is, I was once coincidentally attracted by the “hardest problem in computer science”, the P vs. NP problem. This asks whether every problem whose solution can be quickly verified (NP) can be quickly solved (P). In other words, it is asking: easy cheking == easy solving? We will talk about it later in Complexity Theory.

Resource

My main way of learning the theory of computation is Professor Michael Sipser‘s Introduction to the Theory of Computation