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.
Jan 07, 2026
01 What is Theoretical Computer Science?
Jan 07, 2026
02 The Language of Computation - Alphabets, Words, and Languages
Jan 07, 2026
03 Formalizing Algorithmic Problems and Information
Jan 07, 2026
04 Kolmogorov Complexity and the Nature of Randomness
Jan 07, 2026
05 Proving the Prime Number Theorem, Introduction to Finite Automata
Jan 07, 2026
06 Formalizing Finite Automata
Jan 07, 2026
07 Combining Automata and Proving Non-Regularity
Jan 07, 2026
08 Proving Non-Regularity
Jan 07, 2026
09 Turing Machines
Jan 07, 2026
10 Extensions of the Turing Machine Model
Jan 07, 2026
11 Nondeterminism, Equivalence, and Countability
Jan 07, 2026
12 Undecidability and Reductions
Jan 07, 2026
13 Theory of Undecidability and Reductions
Jan 07, 2026
14 Reductions, The Halting Problem, and Emptiness