Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Decision problem

Related lectures (27)

Explores smart contracts in Bitcoin, UTXO model, authorization, validity checks, challenges, applications, and emerging trends.

Explores the existence of functions that cannot be computed, illustrated by famous paradoxes and the concept of undecidable problems.

Provides an introduction to MATLAB and Octave, focusing on basic usage and key features.

Covers the theory of computability and the halting problem in algorithms.

Explores counting infinite sets and decision problems, showcasing the limits of computation in solving certain undecidable problems.

Explores the theory of computability, decision problems, complexity classes, and the 'P vs. NP' conundrum.

Explores undecidability through recursive languages, Turing machines, and the halting problem.

Examines NP problems, graph coloring, path optimization, and computational complexity distinctions in P and NP classes.

Explores the Halting Problem, efficient list element positioning, and the cashier's algorithm.

Explores the unsolvability of the halting problem in algorithms and the limitations of procedures in determining program halting.

Explains thermodynamic properties, equations of state, and mixture rules for energy systems modeling.

Discusses algorithms to prevent starvation and maximize philosophers eating simultaneously.

Explores the journey and responsibilities of a vice president in pharmaceutical manufacturing at Johnson & Johnson.

Explores optimization in energy system modeling, covering decision variables, objective functions, and different strategies with their pros and cons.

Explores linear search, insertion sort, coin change, maximum matching, and the halting problem in algorithms.

Explores chaos in quantum field theories, focusing on conformal symmetry, OPE coefficients, and random matrix universality.

Delves into the theory of computation, covering decidability, complexity, P vs. NP, and reductions.

Explores countability and undecidable problems in the theory of computation.

Explores distributed computation between two parties in a distant setting.

Explores the dynamics of a rolling cylinder on inclined planes with and without slipping.