From f38900cfa92f32ec61029a77676d22bec6d033fc Mon Sep 17 00:00:00 2001
From: Thomas Walker Lynch <eknp9n@reasoningtechnology.com>
Date: Sun, 19 Jul 2026 16:40:39 +0000
Subject: [PATCH] .

---
 document/book/TM-2026.html | 4 +++-
 1 file changed, 3 insertions(+), 1 deletion(-)

diff --git a/document/book/TM-2026.html b/document/book/TM-2026.html
index c10d51e..548d0cf 100644
--- a/document/book/TM-2026.html
+++ b/document/book/TM-2026.html
@@ -342,7 +342,7 @@
 
       <RT·chapter>The computation theoretic Turing Machine</RT·chapter>
 
-<h2>The Hopcroft and Ullman Turing Machine</h2>
+      <h2>The Hopcroft and Ullman Turing Machine</h2>
 
       <p>This definition comes from Hopcroft and Ullman's book with minor terminology changes to make it flow into the text here <RT·endnote>John E. Hopcroft and Jeffrey D. Ullman, <em>Introduction to Automata Theory, Languages, and Computation</em> (Reading: Addison Wesley, 1979).</RT·endnote>.
       </p>
@@ -526,6 +526,8 @@
         </RT·math>
       </div>
 
+      <p>Given that the number of symbols expands with <RT·math>2^ϡ</RT·math>, where <RT·math>ϡ</RT·math> is the number of bits in a word, doing a reverse string operation with a Turing Machine becomes impractical even for small word widths. So it isn't the infinite tape, per sé that binds the Turing Machine to the abstract, but it is this attribute of enumerating symbols on branches that does so.</p>
+
       <p>The total number of steps for reversing an <RT·math>n</RT·math> character string:</p>
 
       <div style="margin-left: 2em;">
-- 
2.20.1