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
Decision problem
Formal sciences
Theoretical computer science
Theory of computation
Computational complexity th...
Graph Chatbot
Related lectures (27)
Login to filter by course
Login to filter by course
Reset
Smart Contracts: Bitcoin and UTXO
Explores smart contracts in Bitcoin, UTXO model, authorization, validity checks, challenges, applications, and emerging trends.
Understanding Chaos in Quantum Field Theories
Explores chaos in quantum field theories, focusing on conformal symmetry, OPE coefficients, and random matrix universality.
Theory of Computation: Decidability and Complexity
Delves into the theory of computation, covering decidability, complexity, P vs. NP, and reductions.
Theory of Computation: Countability and Undecidable Problems
Explores countability and undecidable problems in the theory of computation.
Theory of Computation: Undecidable Problems
Explores the existence of functions that cannot be computed, illustrated by famous paradoxes and the concept of undecidable problems.
Introduction to MATLAB and Octave
Provides an introduction to MATLAB and Octave, focusing on basic usage and key features.
Theory of Computability and Halting Problem
Covers the theory of computability and the halting problem in algorithms.
Theory of Computation: Counting and Decision Problems
Explores counting infinite sets and decision problems, showcasing the limits of computation in solving certain undecidable problems.
Theory of Computability: Solvability and Complexity
Explores the theory of computability, decision problems, complexity classes, and the 'P vs. NP' conundrum.
Undecidability: Recursive Languages and Turing Machines
Explores undecidability through recursive languages, Turing machines, and the halting problem.
Theory of Computation: NP Problems Examples
Examines NP problems, graph coloring, path optimization, and computational complexity distinctions in P and NP classes.
Distributed Computation I
Explores distributed computation between two parties in a distant setting.
Rolling Motion: Friction and Inclined Planes
Explores the dynamics of a rolling cylinder on inclined planes with and without slipping.
Algorithms: Halting Problem Quiz
Explores the Halting Problem, efficient list element positioning, and the cashier's algorithm.
Halting Problem: Unsolvable Problems
Explores the unsolvability of the halting problem in algorithms and the limitations of procedures in determining program halting.
Thermodynamic Properties: Equations and Models
Explains thermodynamic properties, equations of state, and mixture rules for energy systems modeling.
Dining Philosophers Problem
Discusses algorithms to prevent starvation and maximize philosophers eating simultaneously.
Hidden Subgroup Algorithm
Continues the discussion on Simon's hidden subgroup problem, focusing on finding a basis.
Discrete Pressure Modes in Lecture 4
Explores discrete pressure modes and their impact on system analysis.
Manopt: Optimization on Manifolds
Introduces Manopt, a toolbox for optimization on manifolds, covering gradient and Hessian checks, solver calls, and manual caching.
Previous
Page 1 of 2
Next