Skip to main content
Graph
Search
fr
|
en
Login
Search
All
Categories
Concepts
Courses
Lectures
MOOCs
People
Practice
Publications
Startups
Units
Show all results for
Home
Concept
Turing machine
Formal sciences
Theoretical computer science
Theory of computation
Computability theory
Graph Chatbot
Related lectures (32)
Login to filter by course
Login to filter by course
Reset
Previous
Page 1 of 4
Next
Turing Machines: Recursive Languages
Explores Turing machines, recursive languages, undecidability, and symbol elimination.
Theoretical Properties of RNNs
Explores the theoretical properties and practical power of Recurrent Neural Networks, including their relationship to state machines and Turing completeness.
Turing Machines: Recursive Languages
Covers Turing machines, recursive languages, undecidability, and infinite executions in computational theory.
Turing Machines: Decidability and Recursion Theory
Explores decidability in Turing machines and recursive languages.
Undecidability: Part 1
Introduces undecidability in recursive languages and Turing machines, showing languages without algorithmic recognition.
Turing Machines: Basics
Covers the basics of Turing machines, including states, tape manipulation, and problem-solving capabilities.
LabVIEW Design Patterns
Explores LabVIEW design patterns including local variables, race conditions, state machines, and queues.
Undecidability: Recursive Languages and Turing Machines
Explores undecidability through recursive languages, Turing machines, and the halting problem.
Formal Definition of Turing Machines
Explores the theoretical definition of computation and introduces Turing machines.
Turing Machine Example: Testing for Even Numbers
Demonstrates a Turing machine testing for even numbers using binary input.
