slides: fix up for presentation

doc/slides/Makefile

 TEX_SOURCES = $(wildcard *.tex)
 
+all: slides.pdf slides-nup.pdf
+
 slides.pdf: $(TEX_SOURCES) references.bib
 	pdflatex slides.tex
 	biber slides
 	pdflatex slides.tex
 
+slides-nup.pdf: slides.pdf
+	pdfnup --nup '2x2' slides.pdf
+
 view: slides.pdf
 	mupdf $<
 
@@ -13,4 +18,4 @@ clean:
 	rm -f *.aux *.bbl *.blg *.dvi *.log *.pdf *.out
 	rm -f *.bcf *.run.xml
 
-.PHONY: view clean
+.PHONY: all view clean

doc/slides/slides.tex

@@ -40,12 +40,6 @@
 
 \frame{\titlepage}
 
-% [Table of Contents]
-
-\begin{frame}{Table of Contents}
-  \tableofcontents{}
-\end{frame}
-
 % [Context]
 
 \section{Context}
@@ -59,7 +53,7 @@
 
   \begin{itemize}
   \item \emph{Tetrapodal Search} wants to be a unified search for
-    four distinct areas of mathematical knowledge~\cite{tetra}.
+    the four distinct areas of mathematical knowledge~\cite{tetra}.
     \begin{itemize}
         \item Symbolic Knowledge: Formulae, syntax trees\ldots
         \item Concrete Knowledge: Examples, listings\ldots
@@ -119,7 +113,7 @@
   \vspace{2mm}
 
   While the exploring part is probably the more interesting to talk
-  about, the implementation probably has more practical use.
+  about, the implementation has more practical use.
 \end{frame}
 
 % [Implementation]
@@ -227,8 +221,8 @@
         \item SPARQL is an universal query language for RDF~triplet
             data.
           \item RDF4J is a JVM-based library that builds on top of
-            {SPARQL}. It does not do more, but it can be more
-            convenient.
+            {SPARQL}. It is not more powerful than~{SPARQL}, but
+            sometimes more convenient.
       \end{itemize}
     \item While the applications themselves are not terribly
       interesting, they lead us to some interesting questions.
@@ -310,7 +304,6 @@
   \begin{itemize}
     \item One query for a tetrapodal search system is the following:
       ``Find theorems with non-elementary proofs.''~\cite{tetra}.
-      problems''~\cite{tetra}.
       \begin{itemize}
         \item Assuming ``elementary'' means easy~\cite{elempro}, we
           need to find a way of rating the difficulty of proofs.
@@ -339,7 +332,7 @@
         \item Algorithms aren't programs! Programs implement
           algorithms that solve problems.
         \item Maybe it would be interesting to collect a database of
-          algorithms and proofs (OEIS~\cite{oeis} for algorithms).
+          algorithms and problems (OEIS~\cite{oeis} for algorithms).
       \end{itemize}
   \end{itemize}
 
@@ -364,9 +357,11 @@
       way out as diffing huge data sets is not feasible.
     \item Existing exports have ``holes'', they only use small-ish
       subsets of~{ULO}. On the other hand, representing algorithms and
-      algorithmic problems might require us to extend~{ULO}? Maybe instead
+      algorithmic problems might require us to extend~{ULO}. Maybe instead
       of tetrapodal search we need $n$-podal search.
   \end{itemize}
+
+  $\hfill\square$
 \end{frame}
 
 % [References]