Theoretical Computer Science Courses and Certifications

Ryan O'Donnell

Great Ideas in Theoretical Computer Science: Time Complexity - Spring 2016

Explore time complexity in theoretical computer science, covering running time, worst-case scenarios, and common runtime scaling, with practical examples and formal definitions.

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

Ryan O'Donnell

Great Ideas in Theoretical Computer Science - Turing's Legacy

Explore Turing Machines, their definition, and programming techniques in this theoretical computer science lecture, covering interpreters, formal definitions, and practical TM subroutines.

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

Ryan O'Donnell

Great Ideas in Theoretical Computer Science: Finite Automata

Explore finite automata and regular languages in theoretical computer science, covering DFAs, computation concepts, and language analysis techniques.

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

Ryan O'Donnell

Great Ideas in Theoretical Computer Science - Polynomials

Explore theoretical computer science through polynomials, covering fields, division, evaluation, interpolation, and error-correcting codes. Gain insights into fundamental concepts and their applications.

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

Ryan O'Donnell

Great Ideas in Theoretical Computer Science: Computability

Explore computability theory, Turing machines, and undecidable problems in this theoretical computer science lecture, focusing on fundamental concepts and their implications.

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

Ryan O'Donnell

Great Ideas in Theoretical Computer Science - Graphs - The Basics

Explore fundamental concepts of graph theory, including definitions, basic questions, regular graphs, and perfect matching. Gain insights into connecting graphs and equivalence relations.

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

Ryan O'Donnell

Great Ideas in Theoretical Computer Science - Approximation Algorithms

Explore approximation algorithms for NP-hard problems, focusing on Vertex Cover, k-Coverage, and Traveling Salesperson. Learn techniques to find near-optimal solutions efficiently.

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

Society for Industrial and Applied Mathematics

Certificates of Nonnegativity and Their Applications in Theoretical Computer Science

Explore nonnegativity certificates in real algebraic geometry, focusing on sums of squares and sums of nonnegative circuit polynomials, with applications to polynomial optimization and theoretical computer science.

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

Models of Consciousness Conferences

A Theoretical Computer Science Perspective on Consciousness

Explore the Conscious Turing Machine model and its insights into consciousness phenomena, including blindsight, inattentional blindness, and free will.

• YouTube
• 20 minutes
• Self-Paced
• Conference Talk

Simons Institute

AI for Mathematics and Theoretical Computer Science

Discover insights from Sophie Morel's talk at the Simons Institute and SLMath Joint Workshop on AI for Mathematics and Theoretical Computer Science.

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

Models of Consciousness Conferences

Insights on Consciousness from Theoretical Computer Science

Explore groundbreaking theoretical computer science perspectives on consciousness through the Conscious Turing Machine model, examining consciousness validation and pain perception mechanisms.

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

Models of Consciousness Conferences

A Theoretical Computer Science Approach to Consciousness and AGI

Explore a theoretical computer science approach to consciousness and AGI through the Conscious Turing Machine model, offering insights into processor utilization and problem-solving.

• YouTube
• 53 minutes
• Self-Paced
• Conference Talk

É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