"Wissenschaft für jedermann" with Professor Stefan Weltge

Why can some problems be solved with only a few computational steps, while others remain practically unsolvable even with enormous technical effort? Behind this seemingly simple question lies one of the central unsolved problems of theoretical computer science: the P vs. NP problem. Originally rooted in computer science, it has far-reaching implications for mathematics and has given rise to an international field of research involving thousands of scientists worldwide.

The lecture embarks on an exciting journey through the world of algorithmic complexity. Starting with familiar puzzles such as Sudoku, it spans a broad range of cutting-edge applications, from chip design and the optimization of complex systems to modern cryptography. Along the way, it becomes clear why certain tasks, despite their simple formulation, push our computational capabilities to their fundamental limits.

In this lecture, Prof. Dr. Stefan Weltge provides an accessible insight into what can be computed efficiently—and what may lie fundamentally beyond our computational reach. At the same time, he demonstrates why the P vs. NP problem is not merely an abstract theoretical question, but one with profound implications for technology, security, and our understanding of computability.

Moderation: Matthias Scherer, Professur für Risk and Insurance

All CIT lectures at Wissenschaft für jedermann