Skip to main content
Graph
Search
fr
en
Login
Search
All
Categories
Concepts
Courses
Lectures
MOOCs
People
Quizes
Exercises
Publications
Startups
Units
Show all results for
Home
Lecture
Turing Machines: Recursive Languages
Graph Chatbot
Related lectures (22)
Undecidability: Part 1
Introduces undecidability in recursive languages and Turing machines, showing languages without algorithmic recognition.
Turing Machines: Recursive Languages
Explores Turing machines, recursive languages, undecidability, and symbol elimination.
Undecidability: Recursive Languages and Turing Machines
Explores undecidability through recursive languages, Turing machines, and the halting problem.
Turing Machines: Recursive Languages
Explores Turing machines, recursive languages, and decidability in the theory of computation.
Recursive Enumerability: Turing Machines and Undecidable Languages
Covers recursively enumerable languages, Turing machines, and the construction of undecidable languages.
Turing Machines: Decidability and Recursion Theory
Explores decidability in Turing machines and recursive languages.
Computational Complexity
Covers the basics of computational complexity, including big O notation and complexity classes.
Turing Machines: Basics
Covers the basics of Turing machines, including states, tape manipulation, and problem-solving capabilities.
Formal Definition of Turing Machines
Explores the theoretical definition of computation and introduces Turing machines.
Universal Turing Machine: Definition and Functioning
Explores the universal Turing machine, its canonical representation, and its role in defining algorithms and theoretical computer science concepts.
Halting Problem: Unsolvable Problems
Explores the unsolvability of the halting problem in algorithms and the limitations of procedures in determining program halting.
Turing Machine Example: Testing for Even Numbers
Demonstrates a Turing machine testing for even numbers using binary input.
Computational Complexity: Theory and Applications
Explores computational complexity, NP-completeness, and polynomial reductions in theoretical computer science.
Theory of Computability and Halting Problem
MOOC: Information, Computation, Communication: Introduction to computational thinking
Covers the theory of computability and the halting problem in algorithms.
Halting Problem: Unsolvable Problems
Explores the halting problem, demonstrating its unsolvability and the limitations of algorithms.
Algorithm Design: Divide and Conquer
Covers recursion, dynamic programming, and algorithm design using divide and conquer strategies.
Berni Alder Prize: Celebrating 50 Years of CECAM
Commemorates 50 years of CECAM and the Berni J. Alder CECAM Prize, covering milestones in computational methods, quantum mechanics, slip motion, and more.
Computational Methods: Paths and Strings
Log in to Mediaspace to watch this video
Covers computational methods focusing on paths and strings, including examples of concatenation, regex elements, and string operations.
Theory of Computation: Decidability and Complexity
Log in to Mediaspace to watch this video
Delves into the theory of computation, covering decidability, complexity, P vs. NP, and reductions.
Linear Algebra: Efficiency and Complexity
Log in to Mediaspace to watch this video
Explores constraints, efficiency, and complexity in linear algebra, emphasizing convexity and worst-case complexity in algorithm analysis.
Previous
Page 1 of 2
Next
