Turing Machines Courses and Certifications

TheIACR

Indistinguishability Obfuscation for Turing Machines - Constant Overhead and Amortization

Explore advanced cryptographic techniques for Turing machines, focusing on indistinguishability obfuscation with constant overhead and amortization methods.

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

NPTEL;  IIT Kanpur

Theory of Computation

6 ratings

Explore finite automata, regular languages, context-free grammars, and Turing machines. Learn about computational models, their properties, and fundamental concepts in theoretical computer science.

• YouTube
• 1 day 15 hours
• Self-Paced
• 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
• Self-Paced
• Paid Course

Computability, Complexity & Algorithms

1 rating

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

• Udacity
• 15 hours
• Self-Paced
• Free Online Course

Ryan O'Donnell

Undergrad Complexity at CMU - Oracle Turing Machines and P^NP

Explore oracle Turing machines and P^NP in computational complexity theory, focusing on solving algorithms, consequences, and the Minimum Circuit Problem.

• YouTube
• 1 hour 22 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

Anyscale

Physical AI Turing Test - The Evolution of Robotics and Intelligent Machines

Explore the evolution of robotics from mechanical systems to AI-driven machines with NVIDIA's Jim Fan, covering the Physical Turing Test and cutting-edge training methods.

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

Chhattisgarh Swami Vivekanand Technical University;  IGNOU

Formal Language and Automata Theory- An Application in Compiler Design

Explore formal languages, automata theory, and their application in compiler design. Learn about finite automata, grammars, parsing techniques, and code generation.

• Swayam
• 12 weeks
• Self-Paced
• Free Online Course

Ben Eater

Making a Computer Turing Complete

Explore Turing completeness, Turing machines, and Lambda calculus, and learn how to make an 8-bit breadboard computer capable of solving any computable problem.

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

Ryan O'Donnell

Undergraduate Computational Complexity Theory

Explore fundamental computational complexity theory through 28 comprehensive lectures covering P vs NP, reductions, space complexity, and randomized algorithms from Carnegie Mellon.

• YouTube
• 1 day 13 hours 36 minutes
• Self-Paced
• Free Video

Introduction to the Theory of Computing - Stanford

Explore fundamental concepts of theoretical computer science, including automata, computability, and complexity theory, with practical applications and algorithmic fairness.

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

Theory of Computation, Fall 2020

Explore computability and complexity theory with MIT's in-depth course. Covers automata, Turing machines, undecidability, NP-completeness, and advanced topics in computational theory.

• YouTube
• 1 day 8 hours
• Self-Paced
• Free Video

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
• Self-Paced
• Free Video

World Science Festival

Coding Consciousness - An Algorithm for Awareness?

Explore theories of consciousness with computer scientists Lenore and Manuel Blum as they discuss the potential for coding self-awareness into algorithms, moderated by Brian Greene.

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

Dr Trefor Bazett

Kolmogorov Complexity and Random Numbers - Understanding Pi Through Computational Theory

Explore Kolmogorov Complexity and its connection to randomness through an engaging mathematical journey that proves the infinity of prime numbers using computational concepts.

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