Mercurial > 13ss.theoinf
comparison notes/tex/computation.tex @ 49:72ac27051d7e
fix some more errors; reorganize complete notes
| author | Markus Kaiser <markus.kaiser@in.tum.de> |
|---|---|
| date | Thu, 11 Jul 2013 23:38:43 +0200 |
| parents | 8e79d33bdece |
| children | adcb0ab03ade |
comparison
equal
deleted
inserted
replaced
| 48:903e6a8959d7 | 49:72ac27051d7e |
|---|---|
| 252 \frametitle{PR-Programme} | 252 \frametitle{PR-Programme} |
| 253 \setbeamercovered{dynamic} | 253 \setbeamercovered{dynamic} |
| 254 | 254 |
| 255 U.a. diese Programme sind laut Vorlesung oder Übung PR: | 255 U.a. diese Programme sind laut Vorlesung oder Übung PR: |
| 256 \begin{itemize} | 256 \begin{itemize} |
| 257 \item $pred(x) = \max \left\{ 0, x - 1 \right\}$ | |
| 257 \item \alert{$add(x, y) = x + y$} | 258 \item \alert{$add(x, y) = x + y$} |
| 259 \item \alert{$x \dot{-} y = \max \left\{ 0, x - y \right\}$} | |
| 258 \item \alert{$mult(x, y) = x \cdot y$} | 260 \item \alert{$mult(x, y) = x \cdot y$} |
| 259 \item $pred(x) = \max \left\{ 0, x - 1 \right\}$ | |
| 260 \item \alert{$x \dot{-} y = \max \left\{ 0, x - y \right\}$} | |
| 261 \item $div(x, y) = x \div y$ (Ganzzahldivision) | 261 \item $div(x, y) = x \div y$ (Ganzzahldivision) |
| 262 \item $mod(x, y) = x \mod y$ | 262 \item Die restliche einfache Arithmetik\ldots |
| 263 \vspace{1.5em} | 263 \vspace{1.5em} |
| 264 \item $tower(n) = 2^{2^{2^{\iddots}}}$ mit $tower(4) = 2^{16}$ | 264 \item $tower(n) = 2^{2^{2^{\iddots}}}$ mit $tower(4) = 2^{16}$ |
| 265 \item $sqr(x) = x^2$ | 265 \item $sqr(x) = x^2$, $sqrt(x) = \sqrt{x}$ |
| 266 \item $twopow(n) = 2^n$ | 266 \item $c(x), p_1(x), p_2(x)$ (Cantorsche Paarungsfunktion) |
| 267 \item $ifthen(n, a, b) = \begin{cases} a & n \neq 0 \\ b & n = 0 \end{cases}$ | 267 \item $ifthen(n, a, b) = \begin{cases} a & n \neq 0 \\ b & n = 0 \end{cases}$ |
| 268 \end{itemize} | 268 \end{itemize} |
| 269 \end{frame} | 269 \end{frame} |
| 270 } | 270 } |
| 271 | 271 |