Computability Courses and Certifications

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
• On-Demand
• Free Video

Association for Computing Machinery (ACM)

On the Computability of Continuous Maximum Entropy Distributions with Applications

Explore computability of continuous maximum entropy distributions, their applications in quantum entropy and interior point methods, and implications for SDP rounding algorithms.

• YouTube
• 24 minutes
• On-Demand
• Free Video

Hausdorff Center for Mathematics

Computability and Definability - Theory and Application - Lecture 3

Explore advanced mathematical definability theory, covering computability, Turing jumps, arithmetic hierarchies, and applications to normality and Hausdorff dimension.

• YouTube
• 1 hour 8 minutes
• On-Demand
• Free Video

Hausdorff Center for Mathematics

Computability and Definability - Theory and Application - 2

Explore mathematical definability theory, covering computability, Turing jumps, arithmetic hierarchies, and applications to topological complexity and real number analysis.

• YouTube
• 1 hour
• On-Demand
• Free Video

Hausdorff Center for Mathematics

Computability and Definability - Theory and Application - 1

Explore mathematical definability theory, covering computability, Turing jumps, arithmetic hierarchies, and applications to topological complexity and real number analysis.

• YouTube
• 1 hour
• On-Demand
• Free Video

Hausdorff Center for Mathematics

Computability and Definability - Theory and Application - Lecture 4

Explore advanced mathematical definability theory, covering computability, Turing jumps, arithmetic hierarchies, and applications to normality and Hausdorff dimension.

• YouTube
• 1 hour 4 minutes
• On-Demand
• Free Video

Hausdorff Center for Mathematics

Computability and Definability - Theory and Application - Lecture 5

Explore advanced mathematical definability theory, covering computability, Turing jumps, arithmetic hierarchies, and applications to normality and Hausdorff dimension.

• YouTube
• 1 hour 3 minutes
• On-Demand
• Free Video

Computability, Complexity & Algorithms

1 review

Learn tools and techniques that will help you recognize when problems you encounter are intractable and when there an efficient solution.

• Udacity
• 15 hours
• On-Demand
• Free Online Course

Insights into Mathematics

Computability and Problems with Set Theory - Math History

Explores historical controversies in set theory, Gödel's incompleteness theorems, Zermelo-Fraenkel axioms, and Turing's computability concepts, challenging traditional views on infinite sets in mathematics.

• YouTube
• 47 minutes
• On-Demand
• Free Video

Insights into Mathematics

Sets, Logic and Computability - Math History - NJ Wildberger

Overview of set theory, logic, and computability in late 19th/early 20th century math, covering Cantor's work, Dedekind's constructions, paradoxes, and philosophical schools addressing foundational issues.

• YouTube
• 53 minutes
• On-Demand
• Free Video

Institute for Pure & Applied Mathematics (IPAM)

Computability and Complexity in Complex Analysis - from 2007 to 2026

Explore two decades of progress in computational aspects of complex analysis, covering conformal maps, harmonic measure, and Carathéodory extension with leading research insights.

• YouTube
• 47 minutes
• On-Demand
• Free Video

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

Automata and Computability

Explore theoretical computation models including finite automata, Turing machines, and complexity theory to understand computational limits and formal language processing.

• Coursera
• 2 days 15 hours
• On-Demand
• Paid Course

Formal Languages and Automata Theory

242 ratings at Udemy

Introduction to Automata Theory, Languages and Computation

• Udemy
• 1 day 13 hours 5 minutes
• On-Demand
• Paid Course

Hausdorff Center for Mathematics

Natural Homology Computability and Eilenberg Steenrod Axioms

Explore natural homology computability and Eilenberg Steenrod axioms in this advanced mathematics lecture, delving into applied and computational algebraic topology concepts.

• YouTube
• 48 minutes
• On-Demand
• Free Video

Churchill CompSci Talks

The Asynchronous Computability Theorem - Distributed Systems and Algebraic Topology

Explore the connection between distributed systems protocols and algebraic topology, proving consensus impossibility in asynchronous wait-free models through combinatorial structures.

• YouTube
• 28 minutes
• On-Demand
• Free Video