Search

Rafael Oliveira
Rafael Oliveira
  • Group
  • Publications
  • Talks
  • Courses
  • Prospective Students
  • Undergraduates
  • Resources
Overview
  • Plan for Lectures
  • Useful Resources
Homework
  • Homework 1
  • Homework 2
  • Homework 3
  • Homework 4
Lecture Notes
  • Lecture 1 - Course Intro, Languages & Decidability
  • Lecture 2 - Turing Machines
  • Lecture 3 - Recursion Theorem
  • Lecture 4 - Undecidability
  • Lecture 5 - Time Complexity
  • Lecture 6 - Non-Deterministic Turing Machines and P vs NP
  • Lecture 7 - Polynomial Hierarchy
  • Lecture 8 - Boolean Circuits & Formulas
  • Lecture 9 - Satisfiability & Cook-Levin
  • Lecture 10 - Non-Uniform Computation
  • Lecture 14 - Space Complexity
  • Contents
  • Acknowledgements & References

Lecture 3 - Recursion Theorem

Still in preparation. Please check the references at the end of the document.

Acknowledgements & References

This lecture was based on these resources:

  • [S13, Section 6.1]
  • Lecture notes by Prof. Eric Blais.
Previous
Lecture 2 - Turing Machines
Next
Lecture 4 - Undecidability

Last updated on Sep 13, 2024

Edit this page

Powered by the Academic theme for Hugo.

Cite
Copy Download