Theoretical Computer Science Courses and Certifications

Sundeep Saradhi Kanthety

Chomsky Normal Form and Conversion of CFG to CNF in Automata Theory

Learn to convert Context-Free Grammars to Chomsky Normal Form, a standardized format for simplifying and analyzing grammars in automata theory. Understand the steps and rules for this important transformation.

• YouTube
• 31 minutes
• Self-Paced
• Free Video

David Shapiro ~ AI

Predictions About Artificial Super Intelligence - Theoretical Limits and Capabilities

Explore theoretical limits and cutting-edge capabilities in AI, quantum computing, and more. Delve into concepts like the Landauer Limit, universal computation, and optimal intelligence to understand the future of machine cognition.

• YouTube
• 32 minutes
• Self-Paced
• Free Video

Simons Institute

Black Holes and the Quantum-Extended Church-Turing Thesis - Quantum Colloquium

Explore black holes' impact on quantum computing, featuring insights from renowned physicists on horizon properties, information extraction, and the quantum-extended Church-Turing thesis.

• YouTube
• 2 hours 7 minutes
• Self-Paced
• Free Video

Simons Institute

Classical Verification of Quantum Computations

Explore verification methods for quantum computations, including interactive proofs, post-quantum cryptography, and measurement protocols, with insights on challenges and potential solutions.

• YouTube
• 1 hour 2 minutes
• Self-Paced
• Free Video

Up and Atom

Amateur Mathematicians Solve 30-Year-Old Busy Beaver Problem

Discover how amateur mathematicians cracked a complex 30-year-old mathematical puzzle involving busy beaver Turing machines, exploring computational theory and mathematical problem-solving techniques.

• YouTube
• 20 minutes
• Self-Paced
• Free Video

Tutorial on Stochastic Thermodynamics - David Wolpert

Explore stochastic thermodynamics with David Wolpert, covering Landauer's principle, approximate computing, performance constraints, and thermodynamic complexity in computational systems.

• YouTube
• 1 hour 14 minutes
• Self-Paced
• Free Video

Paul G. Allen School

Computational Complexity and Explanations in Physics

Explore how computational intractability shapes physical explanations, from quantum mechanics interpretations to black hole paradoxes and thermodynamics.

• YouTube
• 1 hour 11 minutes
• Self-Paced
• Free Video

Java

The Static Dynamic JVM - A Many Layered Dive

Explore how the JVM balances static analysis with dynamic execution through theoretical concepts and real-world optimization techniques with Oracle's John Rose.

• YouTube
• 1 hour 1 minute
• Self-Paced
• Free Video

Simons Institute

Optimal Broadcast Encryption and More from Evasive LWE

Explore advanced cryptographic techniques using evasive LWE, focusing on optimal broadcast encryption and its applications in secure communication systems.

• YouTube
• 46 minutes
• Self-Paced
• Free Video

Simons Institute

New Quantum Cryptographic Primitives I

Explore cutting-edge quantum cryptography with Mark Zhandry, delving into novel primitives and their implications for secure communication in the quantum era.

• YouTube
• 1 hour 5 minutes
• Self-Paced
• Free Video

Simons Institute

SAT-Solving

Explore the theory and practice of SAT-solving, delving into satisfiability concepts and advanced techniques in this comprehensive lecture by Armin Biere.

• YouTube
• 4 hours 23 minutes
• Self-Paced
• Free Video

Simons Institute

Improved Bounds for the Sunflower Lemma

Explore recent progress on the sunflower conjecture, examining structure vs pseudo-randomness and connections to DNF simplification under random restrictions.

• YouTube
• 1 hour 50 minutes
• Self-Paced
• Free Video

Simons Institute

Quantum Random Walks

Explore quantum random walks and their applications in algorithms, complexity, and cryptography, with insights from expert Andras Gilyen.

• YouTube
• 1 hour 18 minutes
• Self-Paced
• Free Video

Simons Institute

Lattices and Quantum

Explore the intersection of lattice-based cryptography and quantum computing with expert Zvika Brakerski, delving into cutting-edge research and potential implications for future security systems.

• YouTube
• 1 hour 4 minutes
• Self-Paced
• Free Video

Simons Institute

Efficient Zero-Knowledge Proofs: A Modular Approach

Explore modular techniques for creating efficient zero-knowledge proofs, focusing on probabilistically checkable and interactive proof systems in cryptography.

• YouTube
• 1 hour 12 minutes
• Self-Paced
• Free Video