Code++ Lectures

Code++ is a club dedicated to learning advanced computer science topics. In the 2025-2026 school year, I serve the role of Vice-President within the club.

Busy Beaver Introduction (5/1/2026)

An introductory lecture to Turing Machines and the Busy Beaver problem.

Slides

References

• Parts adatped from https://wiki.bbchallenge.org/wiki/Main_Page.

P vs. NP Overview (2/27/2026)

An introductory lecture to the problem of \(\mathsf{P} \overset{?}{=} \mathsf{NP}\). The lecture is quite advanced, however.

This presentation was originally made in 12/25/2025, but due to scheduling conflicts it had to be pushed back several months.

Slides

References

Inside the slideshow.

Time Complexity (10/17/2025)

Standard lecture about time complexity formally (including details about \(\Omega\) and \(\Theta\)).

Slides

References

• Master Theorem discussion adopted from https://www.math.umd.edu/~immortal/CMSC351/notes/mastertheorem.pdf.

Lambda Calculus Guest Lecture (5/16/2025)

This was a guest lecture for the Code++ club and centered around a friendly introduction into \(\lambda\)-calculus.

Slides

References

• Parts adapted from Peter Selinger’s Lecture Notes on the Lambda Calculus.

Incomplete or Scrapped

Here are some lectures that may be scrapped.

Logic and Proofs (Incomplete, started 6/20/2025)

The following is an incomplete lecture about logic and proofs. I decided to include it because it is partly complete (the entire proof section is), and it is possible that it will be scrapped.

Page