Update headings

wk11/week11.tex

@@ -22,7 +22,7 @@
 % \usepackage{graphicx}
 
 \begin{document}
-	\title{Week 10 - Comparing Algorithms}
+	\title{Week 11 - Virtual experiments}
 	\author{Kelvin Davis \and Jip J. Dekker\and Anthony Silvestere}
 	\maketitle
 
@@ -47,14 +47,13 @@ f(1,0,0) & = & 1\\
 \text{otherwise }f(\_,\_,\_) & = & 0
 \end{eqnarray*}
 
-\subsection{Why do different patterns appear with different update
+\subsection*{Why do different patterns appear with different update
 rules?}\label{why-do-different-patterns-appear-with-different-update-rules}
 
 There are 6 updating schemes:
 
 \begin{enumerate}
 \def\labelenumi{\arabic{enumi}.}
-\tightlist
 \item
   Synchronous - updates cells all at once for each time step
 \item
@@ -76,7 +75,7 @@ The synchronous method updates all the cells at once for each time-step.
 As shown this results in a plot that is consistent. The Random
 Independent method allows any cell to be updated at any time
 
-\subsection{A common mistake in writing programs to run simulation
+\subsection*{A common mistake in writing programs to run simulation
 models is to scan through an array updating each cell in turn, based on
 the current values of its neighbours. Which of the update schemes
 demonstrated corresponds to
@@ -93,7 +92,7 @@ which then results in sparse plots due to only two out of the eight
 possible rules being active i.e.
 \[\dfrac{\sum_{x\in\{0,1\}^3}{f(x)}}{|\{0,1\}^3|} = \dfrac{2}{8}\]
 
-\subsection{Suggest cases where the clock scheme or random asynchronous
+\subsection*{Suggest cases where the clock scheme or random asynchronous
 updating might bean appropriate way to model a system in the real
 world?}\label{suggest-cases-where-the-clock-scheme-or-random-asynchronous-updating-might-bean-appropriate-way-to-model-a-system-in-the-real-world}