Inference Risks for Machine Learning (ICLR Workshop on Distributed and Private Machine Learning)

Main Themes of Course

P=NP Recap

History of the Cook-Levin Theorem

Cook-Levin Theorem

The P=NP Question

Proving a Problem is in NP

Power of Nondeterministic Turing Machines

Complexity Class NP

Introducing NP

Questions about P and EXP

Tractable and Intractable Problems

Satisfiability

Shortest and Longest Paths

RAM Model

"Difficulty" of Functions

Proving Uncomputability (Busy Boas and Busier Beavers)

The Natural Numbers are Computable

Proving Computability and Noncomputability

Rice's Theorem

Prints3 and IsMalware are Undecidable

Finite is Undecidable

HALTS is Undecidable

Proof by Reduction

Decidable, Recognizable, Computable

An Undecidable Problem

Computability in Theory and Practice

ACCEPTS is Uncomputable (Part 2)

ACCEPTS is Uncomputable (Part 1)

Universal Machines