mirror of
https://github.com/janishutz/eth-summaries.git
synced 2026-01-12 14:18:23 +00:00
[TI] Compact: Start
This commit is contained in:
@@ -45,3 +45,31 @@ In other, more different, words, $w_i$ being in $L_\text{diag}$ implies (from th
|
|||||||
|
|
||||||
\setLabelNumber{theorem}{3}
|
\setLabelNumber{theorem}{3}
|
||||||
\inlinetheorem $L_\text{diag} \notin \cL_{RE}$
|
\inlinetheorem $L_\text{diag} \notin \cL_{RE}$
|
||||||
|
|
||||||
|
% ────────────────────────────────────────────────────────────────────
|
||||||
|
|
||||||
|
|
||||||
|
\subsection{Reductions}
|
||||||
|
This is the start of the topics that are part of the endterm.
|
||||||
|
|
||||||
|
First off, a list of important languages for this and the next section:
|
||||||
|
\begin{itemize}
|
||||||
|
\item $L_U = \{ \text{Kod}(M)\# w \divides w \in \wordbool \text{ and TM $M$ accepts } w \}$ ($\in \cL_{RE}$, but $\notin \cL_R$)
|
||||||
|
\item $L_H = \{ \text{Kod}(M)\# x \divides x \in \wordbool \text{ and TM $M$ halts on } x \}$ ($\in \cL_{RE}$, but $\notin \cL_R$)
|
||||||
|
\item $L_{\text{diag}} = \{ w \in \wordbool \divides w = w_i \text{ for an } i \in \N - \{ 0 \} \text{ and $M_i$ does not accept } w_i \}$ ($\notin \cL_{RE}$ and thus $\notin \cL_R$)
|
||||||
|
\item $(L_{\text{diag}})^C$ ($\in \cL_{RE}$, but $\notin \cL_R$)
|
||||||
|
\item $L_{EQ} = \{ \text{Kod}(M)\# \text{Kod}(\overline{M}) \divides L(M) = L(\overline{M}) \}$ ($\in \cL_{RE}$, but $\notin \cL_R$)
|
||||||
|
\item $\lempty = \{ \text{Kod}(M) \divides L(M) = \emptyset \}$ ($\in \cL_{RE}$, but $\notin \cL_R$)
|
||||||
|
\item $(\lempty)^C = \{ x \in \wordbool \divides x \notin \text{Kod}(\overline{M}) \forall \text{ TM } \overline{M} \text{ or } x = \text{Kod}(M) \text{ and } L(M) \neq \emptyset \}$
|
||||||
|
($\in \cL_{RE}$, but $\notin \cL_R$)
|
||||||
|
\item $L_{H, \lambda} = \{ \text{Kod}(M) \divides M \text{ halts on } \lambda \}$ ($\in \cL_{RE}$, but $\notin \cL_R$)
|
||||||
|
\end{itemize}
|
||||||
|
|
||||||
|
\setLabelNumber{theorem}{6}
|
||||||
|
\fancytheorem{Universal TM} A TM $U$, such that $L(U) = L_U$
|
||||||
|
|
||||||
|
% ────────────────────────────────────────────────────────────────────
|
||||||
|
|
||||||
|
\subsection{Rice's Theorem}
|
||||||
|
\setLabelNumber{theorem}{9}
|
||||||
|
\fancytheorem{Rice's Theorem}
|
||||||
|
|||||||
0
semester3/ti-compact/parts/05_complexity.tex
Normal file
0
semester3/ti-compact/parts/05_complexity.tex
Normal file
Binary file not shown.
@@ -6,6 +6,10 @@
|
|||||||
\newcommand{\hdelta}{\hat{\delta}}
|
\newcommand{\hdelta}{\hat{\delta}}
|
||||||
\newcommand{\qacc}{q_{\text{accept}}}
|
\newcommand{\qacc}{q_{\text{accept}}}
|
||||||
\newcommand{\qrej}{q_{\text{reject}}}
|
\newcommand{\qrej}{q_{\text{reject}}}
|
||||||
|
\newcommand{\ldiag}{L_{\text{diag}}}
|
||||||
|
\newcommand{\lempty}{L_{\text{empty}}}
|
||||||
|
\renewcommand{\tc}{\text{Time}}
|
||||||
|
\newcommand{\spc}{\text{Space}}
|
||||||
|
|
||||||
\setup{Theoretical Computer Science - Compact}
|
\setup{Theoretical Computer Science - Compact}
|
||||||
|
|
||||||
|
|||||||
Reference in New Issue
Block a user