Code Hub Presentation: Complexity Theory and Computability

In a Code Hub Event from Kodkollektivet I was holding a presentation about Complexity Theory and Computability. The ambition was to give a sneak peak into both of these topics. To give a sneak peak a proof for the Halting-Problem was presented additionally NP-Completeness was discussed and a simple proof for the problem Knapsack was shown.

Slides are available here under the following license:

Creative Commons Lizenzvertrag
Complexity Theory and Computability
by Hannes F. Kuchelmeister
is licensed under Creative CommonsAttribution-ShareAlike 4.0 International (CC BY-SA 4.0) .