mirror of
https://github.com/janishutz/eth-summaries.git
synced 2025-11-25 02:24:23 +00:00
104 lines
3.4 KiB
TeX
104 lines
3.4 KiB
TeX
\documentclass{article}
|
|
|
|
\input{~/projects/latex/dist/full.tex}
|
|
\setLang{de}
|
|
|
|
\setup{Theoretische Informatik}
|
|
|
|
\newcommand{\hdelta}{\hat{\delta}}
|
|
\newcommand{\qacc}{q_{\text{accept}}}
|
|
\newcommand{\qrej}{q_{\text{reject}}}
|
|
\newcommand{\ldiag}{L_{\text{diag}}}
|
|
\newcommand{\lempty}{L_{\text{empty}}}
|
|
|
|
\begin{document}
|
|
\startDocument
|
|
\usetcolorboxes
|
|
|
|
\vspace{2cm}
|
|
\begin{Huge}
|
|
\begin{center}
|
|
TITLE PAGE COMING SOON
|
|
\end{center}
|
|
\end{Huge}
|
|
|
|
|
|
\vspace{4cm}
|
|
\begin{center}
|
|
\begin{Large}
|
|
``\textit{Wenn Sie die Turing-Maschine als Touring-Maschine in der Prüfung schreiben, dann macht mich das sehr traurig. Ich seh das jeweils. Teilweise sind das sehr elaborierte Trolle, manchmal Leute die nie in die Vorlesungen kommen} (2025-10-14T08:51Z+02:00``)
|
|
|
|
``\textit{Sie können also alle C Programme in Kanonischer Ordnung aufzählen. Sollten Sie dies tun. Wahrscheinlich nicht. Was aber zählt ist, sie \textbf{können} es tun}''
|
|
\end{Large}
|
|
|
|
\hspace{3cm} - Prof. Dr. Dennis Komm, 2025
|
|
\end{center}
|
|
|
|
\vspace{3cm}
|
|
\begin{center}
|
|
HS2025, ETHZ\\[0.2cm]
|
|
\begin{Large}
|
|
Summary of the book \color{MidnightBlue}\fbox{\href{https://link.springer.com/book/10.1007/978-3-658-06433-4}{Theoretische Informatik}}\color{black}
|
|
\end{Large}\\[0.2cm]
|
|
by Prof. Dr. Juraj Hromkovic
|
|
\end{center}
|
|
|
|
\newpage
|
|
|
|
\printtoc{Orange}
|
|
|
|
\begin{scriptsize}
|
|
\begin{itemize}
|
|
\item \textit{Note: Definitions, Lemmas, etc are often 1:1 copies from the book or paraphrased (as I did not find an easier way of stating them)}
|
|
\item \textit{Note: In case I forgot to add the PDF page numbers, you can take the PDF page number is given by $P_{\text{PDF}} = P_{\text{Book}} + 15$}
|
|
\end{itemize}
|
|
\end{scriptsize}
|
|
|
|
\newpage
|
|
|
|
|
|
% Combinatorics
|
|
\input{parts/combinatorics.tex}
|
|
|
|
|
|
% ┌ ┐
|
|
% │ Alphabets │
|
|
% └ ┘
|
|
\newsection
|
|
\section{Alphabete, Wörter, Sprachen und Darstellung von Problemen}
|
|
\stepcounter{subsection}
|
|
\input{parts/01_languages-problems/00_alphabet.tex}
|
|
\input{parts/01_languages-problems/01_algorithmic-problems.tex}
|
|
\input{parts/01_languages-problems/02_kolmogorov-complexity.tex}
|
|
|
|
|
|
% ────────────────────────────────────────────────────────────────────
|
|
% ┌ ┐
|
|
% │ Automata │
|
|
% └ ┘
|
|
\newsection
|
|
\section{Endliche Automaten}
|
|
\stepcounter{subsection}
|
|
\input{parts/02_finite-automata/00_representation.tex}
|
|
\input{parts/02_finite-automata/01_simulations.tex}
|
|
\input{parts/02_finite-automata/02_proofs-of-nonexistance.tex}
|
|
\input{parts/02_finite-automata/03_non-determinism.tex}
|
|
|
|
\newsection
|
|
\section{Turing-Maschinen}
|
|
\setcounter{subsection}{2}
|
|
\input{parts/03_turing_machines/00_intro.tex}
|
|
\input{parts/03_turing_machines/01_multi-band-church-thesis.tex}
|
|
\input{parts/03_turing_machines/02_non-deterministic.tex}
|
|
|
|
\newsection
|
|
\section{Berechenbarkeit}
|
|
\stepcounter{subsection}
|
|
\input{parts/04_computability/00_intro.tex}
|
|
\input{parts/04_computability/01_reduction.tex}
|
|
\input{parts/04_computability/02_rice.tex}
|
|
\input{parts/04_computability/03_kolmogorov.tex}
|
|
|
|
|
|
\end{document}
|