Module 1 & 2 Theory
Important Theory Concepts
1. Church-Turing Thesis
Anything that can be computed by an algorithm can be computed by a Turing machine.
💡 Asaan Samajh: Duniya ka koi bhi step-by-step kaam ek Turing Machine kar sakti hai.
2. The Halting Problem (1936)
No program can correctly decide if ANY other program will stop or run forever.
💡 Asaan Samajh: Computers ki ek limit hai, woh har cheez predict nahi kar sakte.