Section outline

  • ΔΕΥΤΕΡΑ

    • Computability & Undecidability: The Universal Turing Machine, Simulation, Diagonalization


    You can study:
    -Ch.3: p. 57-63 from [1]

    ΠΕΜΠΤΗ

    • Complexity Classes: Complexity Measures, Time and Space Classes, Hierarchy Theorems, Gap Theorem.