diff --git a/blog/2023/03/01/computable-solomoff/.src/main.tex b/blog/2023/03/01/computable-solomoff/.src/main.tex
index cae2d76..c5d1700 100644
--- a/blog/2023/03/01/computable-solomoff/.src/main.tex
+++ b/blog/2023/03/01/computable-solomoff/.src/main.tex
@@ -63,7 +63,7 @@ To fix this, in step 2, we can require that there be not only one Turing machine
 
 Interestingly, that scheme also suggests that there is a tradeoff between arriving at the correct hypothesis as fast as possible—in which case we would just implement the first scheme at full speed—and producing accurate probabilities—in which case it seems like we would use the modification just outlined.
 
-\sectionHow many
+\section{A downside}
 Note that a downside of the procedures outlined above is that at the point we arrive at the correct hypothesis, we don't know that this is the case.
 
 \section{An distracting epicycle: dealing with Turing machines that take too long or do not halt.}