1 files changed, 19 insertions, 5 deletions

diff --git a/docs/posts/turing_complete_type_systems/index.html b/docs/posts/turing_complete_type_systems/index.html
index 1f6fd4c..2a9361e 100644
--- a/docs/posts/turing_complete_type_systems/index.html
+++ b/docs/posts/turing_complete_type_systems/index.html
@@ -28,7 +28,7 @@
             18/06 — 2020
             <div class="stats">
               <span class="stats-number">
-                9.18
+                9.19
               </span>
               <span class="stats-unit">cm</span>
               &nbsp
@@ -44,12 +44,26 @@
           <div class="post-text">
             <p>Rust’s type system is Turing complete:</p>
 <ul>
-<li><a href="https://github.com/doctorn/trait-eval/">FizzBuzz with Rust Traits</a></li>
-<li><a href="https://github.com/Ashymad/fortraith">A Forth implementation with Rust Traits</a></li>
+<li><a href="https://github.com/doctorn/trait-eval/">FizzBuzz with Rust
+Traits</a></li>
+<li><a href="https://github.com/Ashymad/fortraith">A Forth
+implementation with Rust Traits</a></li>
 </ul>
-<p>It is impossible to determine if a program written in a generally Turing complete system will ever stop. That is, it is impossible to write a program <code>f</code> that determines if a program <code>g</code>, where <code>g</code> is written in a Turing complete programming language, will ever halt. The <a href="https://en.wikipedia.org/wiki/Halting_problem">Halting Problem</a> is in fact, an <a href="https://en.wikipedia.org/wiki/Undecidable_problem">undecidable problem</a>.</p>
+<p>It is impossible to determine if a program written in a generally
+Turing complete system will ever stop. That is, it is impossible to
+write a program <code>f</code> that determines if a program
+<code>g</code>, where <code>g</code> is written in a Turing complete
+programming language, will ever halt. The <a
+href="https://en.wikipedia.org/wiki/Halting_problem">Halting Problem</a>
+is in fact, an <a
+href="https://en.wikipedia.org/wiki/Undecidable_problem">undecidable
+problem</a>.</p>
 <p><em>How is any of this relevant?</em></p>
-<p>Rust performs compile-time type inference. The type checker, in turn, compiles and infers types, I would describe it as a compiler inside a compiler. It is possible that <code>rustc</code> may never finish compiling your Rust program! I lied, <code>rustc</code> stops after a while, after hitting the recursion limit.</p>
+<p>Rust performs compile-time type inference. The type checker, in turn,
+compiles and infers types, I would describe it as a compiler inside a
+compiler. It is possible that <code>rustc</code> may never finish
+compiling your Rust program! I lied, <code>rustc</code> stops after a
+while, after hitting the recursion limit.</p>
 <p>I understand that this post lacks content.</p>
 
           </div>