reorg of defintion

diff --git a/document/book/TM-2026.html b/document/book/TM-2026.html
index 98759fc..a3a583f 100644 (file)
--- a/document/book/TM-2026.html
+++ b/document/book/TM-2026.html
@@ -988,6 +988,8 @@
 
       <img src="TTCA_style_TM_reverse.png" class="rt-diagram" alt="TTCAM reverse machine">
 
+      <h2>Analysis of the TTCA reverse machine</h2>
+
       <p>The number of states is constant at 24 independent of how much data is to be reversed. No arc refers to a payload value.</p>
 
       <p>The form of this diagram shows a lead in, a long loop, and a tail leading to done.  This is suggestive of code followed by a while loop that breaks out and then further code completes the program.</p>
@@ -1058,7 +1060,9 @@
         </RT·math>
       </div>
 
-      <p>This machine spends a lot of time shuttling the head between two context areas. One context area for the original string, and one for the resulting reversed string. This suggests that a two head version would be faster. The following is the two head state machine definition:</p>
+      <h2>Two headed reverse string example</h2>
+
+      <p>The reverse string machine spends a lot of time shuttling the head between two context areas. One context area for the original string, and one for the resulting reversed string. This suggests that a two head version would be faster. The following is the two head state machine definition:</p>
 
       <RT·code>
       # TTCA Two-Head String Reverse
@@ -1163,6 +1167,8 @@
 
       <img src="TTCA_2_hd_reverse.png" class="rt-diagram" alt="TTCAM 2 hd reverse machine">
 
+      <h2>Analysis of the two headed reverse string machine</h2>
+
       <p>The number of states has dropped from 24 to 17, while the speed increase is dramatic, with the former quadratic performance becoming linear performance. The total number of steps for reversing an <RT·math>n</RT·math> symbol long string using a two-head TTCA architecture:</p>
 
       <div style="margin-left: 2em;">