diff --git a/semester3/ti-compact/parts/04_computability.tex b/semester3/ti-compact/parts/04_computability.tex
index 1512d14..d9191b7 100644
--- a/semester3/ti-compact/parts/04_computability.tex
+++ b/semester3/ti-compact/parts/04_computability.tex
@@ -154,4 +154,11 @@ or the condition can be restated such that only $L(M)$ is described by it.
 For a more formal proof of that condition, simply show that the implication holds
 
 
-As of HS2025, chapters 5.5 and 5.6 are not relevant for the Endterm or Session exam, so they are omitted here
+\stepcounter{subsection}
+\subsection{The method of the Kolmogorov-Complexity}
+\inlinetheorem The problem of computing the Kolmogorov-Complexity $K(x)$ for each $x$ is algorithmically unsolvable.
+
+\inlinelemma If $L_H \in \cL_R$, then there exists an algorithm to compute the Kolmogorov-Complexity $K(x)$ for each $x \in \wordbool$
+
+
+As of HS2025, chapters 5.5 and 5.7 are not relevant for the Endterm or Session exam, so they are omitted here
diff --git a/semester3/ti-compact/parts/05_complexity.tex b/semester3/ti-compact/parts/05_complexity.tex
index f4b86c7..9430469 100644
--- a/semester3/ti-compact/parts/05_complexity.tex
+++ b/semester3/ti-compact/parts/05_complexity.tex
@@ -181,3 +181,5 @@ A few languages commonly used to show $NP$-completeness:
 \end{itemize}
 where a clique is \TODO Add.
 and a vertex cover is any set $U \subseteq V$ where all edges $\{ u, v \} \in E$ have at least one endpoint $u, v \in U$
+
+We have $SAT \leq_p \text{CLIQUE}$, $SAT \leq 3SAT$, $\text{CLIQUE} \leq VC$
diff --git a/semester3/ti-compact/ti-compact.pdf b/semester3/ti-compact/ti-compact.pdf
index e40bcc5..26290b3 100644
Binary files a/semester3/ti-compact/ti-compact.pdf and b/semester3/ti-compact/ti-compact.pdf differ