Meetings Link to heading
This is where we publish all of our weekly content, along with any other related material. These will be listed in reverse chronological order. If there is anything missing, let us know.
Fall 2023 Link to heading
This semester’s theme will be about all things related to coding theory! This can range from sphere packing, complexity, error correcting codes, and more.
- Alex & Porter - Burst Codes [slides] [source] [video]
- Eyad - Kolmogorov Complexity [slides] [source] [video]
- Hassam - Linear and Cyclic Codes [slides] [source] [video]
- Aditya - Low-Density Parity Checking Codes [slides] [code] [source] [video]
- Sam - Hamming Codes [slides] [source] [video]
- Parth and Andrey - Quantum Gates and Circuits [slides] [source] [video]
- Parth and Andrey - Qubits [slides] [source]
- Anakin - Codes [slides] [source]
- Anakin - REUs & Computational Algebra [slides] [source] [video]
- SIGma - Introduction [slides] [code] [source] [video]
Spring 2023 Link to heading
This semester, we ran meetings about combinatorial structures and algorithms. Much of the material is being based out of Donald Knuth’s “The Art of Computer of Computer Programming” Volumes 4A and 4B. We will also probably look into other sources as the field is quite vast.
- Jeff Erickson - Fusible Numbers [slides] [video]
- Ryan - Streaming [slides] [scribbles] [source] [video]
- Phil - Clustering [slides] [source] [video]
- Parth - Ramsey’s Theorem [slides] [source] [video]
- Anakin - Twin-width [slides] [source] [video]
- Aditya - Burnside’s Lemma [slides] [source] [video]
- Hassam - Canonical Deletions [slides] [source] [video]
- Sam - Permutations [slides] [answers] [source] [video]
- Lou & Anakin - Algorithm X [slides] [source] [video]
- Anakin - Langford Pairings [slides] [answers] [program] [source] [video]
- Anakin - Binary [slides] [answers] [source]
- SIGma - Introduction [slides] [source] [video]
Fall 2022 Link to heading
This semester was our first semester! As such, we decided to start with some more introductory material. The material was loosely based on Michael Sipser’s “Introduction to the Theory of Computation”
- Aditya - Lisp [slides] [answers] [source]
- Husnain - Generating Functions [slides] [source]
- Phil - Lambda Calculus [slides] [source]
- Anakin - Reductions [slides] [source]
- Anakin - Decidability and Recognizability [slides] [source]
- Sam - Turing Machines and Decidability [slides] [source]
- Hassam - Parsing [slides] [source]
- Anakin - CFGs and PDAs [slides] [source]
- Aditya - Hardware [slides] [source]
- Anakin - NFAs and CFGs [slides] [source]
- Anakin - Regex and DFAs [slides] [source]
- SIGma - Introduction [slides] [source]