Theoretical Computer Science Courses and Certifications

École normale supérieure

Approximation Algorithms Part I

558 ratings at Coursera

Explore approximation algorithms for NP-hard problems using linear programming and randomized rounding techniques. Learn to design efficient solutions with provable guarantees for combinatorial optimization challenges.

• Coursera
• 1 day 12 hours 54 minutes
• Self-Paced
• Paid Course

Computer Science 101: Master the Theory Behind Programming

6739 ratings at Udemy

Computer Science 101: Learn Computer Science to become a better Programmer and Software Engineer.

• Udemy
• 11 hours 50 minutes
• Self-Paced
• Paid Course

Quantitative Formal Modeling and Worst-Case Performance Analysis

44 ratings at Coursera

Explore token systems, Petri-nets, and dataflow graphs. Master mathematical modeling and worst-case performance analysis techniques for embedded systems. Develop abstract thinking skills.

• Coursera
• 17 hours 26 minutes
• Self-Paced
• Paid Course

Instituto de Matemática Pura e Aplicada

Mestrado: Computação, Lógica e Teoria dos Conjuntos - Aula 01

Explore fundamentos de computação, lógica e teoria dos conjuntos em aula de mestrado. Aborde linguagens formais, máquinas de registro, decidibilidade, complexidade algorítmica e lógica de primeira ordem.

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

École normale supérieure

Approximation Algorithms Part II

46 ratings at Coursera

Explore advanced approximation algorithms using linear programming duality and semidefinite programming for combinatorial optimization problems like Steiner forest, facility location, and maximum cut.

• Coursera
• 1 day 11 hours 30 minutes
• Self-Paced
• Paid Course

Birla Institute Of Technology And Science–Pilani (BITS–Pilani)

Formal Languages and Applications

Explore formal language theory, automata, and parsing algorithms to build lexical analyzers and language recognition systems for compilers and NLP applications.

• Coursera
• 2 days 13 hours 30 minutes
• Self-Paced
• Paid Course

Theory of Computation

Explore computability and complexity theory, covering languages, decidability, reducibility, computational measures, completeness, hierarchies, oracles, probabilistic computation, and interactive proof systems.

• MIT OpenCourseWare
• Self-Paced
• Free Online Course

Centre International de Rencontres Mathématiques

String Attractors of Rote Sequences

Explore string attractors of Rote sequences in combinatorics on words, delving into mathematical concepts and their applications.

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

Coding Train

Context-Free Grammar - Programming with Text - Session 7

Explore context-free grammar techniques using Tracery and RiTa.js to generate dynamic text and create fractal tree visualizations through recursive programming methods.

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

Theory of Computation : Become a master of DFA

328 ratings at Udemy

Master Deterministic Finite Automata of Theory of Computation as Theory of Computation forms core of computer science

• Udemy
• 7 hours 43 minutes
• Self-Paced
• Paid Course

Simons Institute

Homomorphism Indistinguishability - Graph Learning and Theoretical Computer Science

Explore the theoretical foundations of homomorphism indistinguishability and its applications in graph learning, quantum information, and computational complexity analysis.

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

Computation in Complex Systems

Explore computational complexity from polynomial-time algorithms to NP-complete problems and undecidable challenges, bridging computer science with physics and biology applications.

• Complexity Explorer
• Self-Paced
• Free Certificate

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

Yannic Kilcher

On the Theoretical Limitations of Embedding-Based Retrieval

Explore theoretical limits of vector embeddings in retrieval tasks through analysis of a research paper showing fundamental dimensional constraints even with simple queries.

• YouTube
• 49 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