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
Universal Turing machine
Formal sciences
Theoretical computer science
Theory of computation
Computability theory
Graph Chatbot
Related lectures (25)
Login to filter by course
Login to filter by course
Reset
Previous
Page 2 of 3
Next
Dynamics of Steady Euler Flows: New Results
Explores the dynamics of steady Euler flows on Riemannian manifolds, covering ideal fluids, Euler equations, Eulerisable flows, and obstructions to exhibiting plugs.
Undecidability: Recursive Languages and Turing Machines
Explores undecidability through recursive languages, Turing machines, and the halting problem.
Theory of Computability and Halting Problem
Covers the theory of computability and the halting problem in algorithms.
Turing Machines: Recursive Languages
Explores Turing machines, recursive languages, and decidability in the theory of computation.
Practical Machining Internship
Introduces a practical machining internship for second-year Microengineering students.
Halting Problem: Unsolvable Problems
Explores the halting problem, demonstrating its unsolvability and the limitations of algorithms.
Halting Problem: Unsolvable Problems
Explores the unsolvability of the halting problem in algorithms and the limitations of procedures in determining program halting.
LabVIEW Design Patterns
Explores LabVIEW design patterns including local variables, race conditions, state machines, and queues.
Machine Usage Basics
Covers the practical aspects of using a Fehlmann type picomax machine, emphasizing tool handling, precision adjustments, and maintenance procedures.
Recursive Enumerability: Turing Machines and Undecidable Languages
Covers recursively enumerable languages, Turing machines, and the construction of undecidable languages.
