INT201 W2
This is the note of INT201 Week2. The lecture is still focusing on decision, computation and language.
Alphabet A,
A* = {alll strings consisting symbols from A}
A subset L of A* is called a language
Question: For a language L, does exist an algorithm to check for any x, if x is in L?