CS Notes
Search
Search
Dark mode
Light mode
Explorer
Home
❯
01 Semesters (BSc)
❯
Semester 3
❯
Theoretical Computer Science
❯
Lecture Notes
Folder: 01-Semesters-(BSc)/Semester-3/Theoretical-Computer-Science/Lecture-Notes
14 items under this folder.
Dec 15, 2025
01 What is Theoretical Computer Science?
Dec 15, 2025
02 The Language of Computation - Alphabets, Words, and Languages
Dec 15, 2025
03 Formalizing Algorithmic Problems and Information
Dec 15, 2025
04 Kolmogorov Complexity and the Nature of Randomness
Dec 15, 2025
05 Proving the Prime Number Theorem, Introduction to Finite Automata
Dec 15, 2025
06 Formalizing Finite Automata
Dec 15, 2025
07 Combining Automata and Proving Non-Regularity
Dec 15, 2025
08 Proving Non-Regularity
Dec 15, 2025
09 Turing Machines
Dec 15, 2025
10 Extensions of the Turing Machine Model
Dec 15, 2025
11 Nondeterminism, Equivalence, and Countability
Dec 15, 2025
12 Undecidability and Reductions
Dec 15, 2025
13 Theory of Undecidability and Reductions
Dec 15, 2025
14 Reductions, The Halting Problem, and Emptiness