--- a/Paper/document/root.tex	Thu Feb 07 03:40:23 2013 +0000
+++ b/Paper/document/root.tex	Thu Feb 07 04:28:00 2013 +0000
@@ -59,8 +59,8 @@
 recursive functions. We also formalise a universal Turing machine and
 Hoare-style reasoning techniques that allow us to reason about Turing machine
 programs. Our theory can be used to formalise other computability
-results. We give one example about the computational equivalence of 
-single-sided Turing machines. 
+results. %We give one example about the computational equivalence of 
+%single-sided Turing machines. 
 %{\it we give one example about the undecidability of Wang's tiling problem, whose proof uses
 %the notion of a universal Turing machine.}
 \end{abstract}