From: Thomas Walker Lynch <eknp9n@reasoningtechnology.com>
Date: Fri, 5 Jun 2026 17:18:12 +0000 (+0000)
Subject: doc work
X-Git-Url: https://git.reasoningtechnology.com/figure_2.png?a=commitdiff_plain;h=9e3f8c973951ddc01f46011aa4846409bb866a6f;p=TM-2026

doc work
---

diff --git a/document/TM-2026.html b/document/TM-2026.html
index 76f5f7a..019b1fc 100644
--- a/document/TM-2026.html
+++ b/document/TM-2026.html
@@ -178,15 +178,15 @@
 <h3>Consequentiality</h3>
 
 <p>
-  The time that a Turing Machine takes to copy a symbol to or from tape is considered to be a single machine step. This is a constant time of one step. It will never affect time complexity results.
+  The time that a Turing Machine takes to copy a symbol to or from tape is considered to be a single machine step. The step itself is part of the step count, and the count certainly is consequential, but the copy itself is a constant of 1. It will never affect time complexity results.
 </p>
 
 <p>
-  The Turing Machine is defined with a finite alphabet and a couple of additional symbols. As these are part of the machine definition, and thus do not change at run time, the time to construct them is inconsequential.
+  The Turing Machine is defined with a finite alphabet and a couple of additional symbols. As these are part of the machine definition, and thus do not change at run time, the time to make them is inconsequential.
 </p>
 
 <p>
-  On a real machine, the factory would be used to create the alphabet and the couple of additional symbols, but as the alphabet is finite, and set in advance, its construction is similarly inconsequential.
+  On a real machine, the factory would be used to create the alphabet and a couple of additional symbols, but as the alphabet is finite, and set in advance, making it is similarly inconsequential.
 </p>
 
 <p>