From: Thomas Walker Lynch Date: Wed, 29 Jul 2026 14:34:03 +0000 (+0000) Subject: re-org, and Universal X-Git-Url: https://git.reasoningtechnology.com/%5B%5E?a=commitdiff_plain;h=7049d7075dc0450e9180257c08022bb5d4475372;p=TM-2026 re-org, and Universal --- diff --git a/document/book/TM-2026.html b/document/book/TM-2026.html index 2551259..9bbc862 100644 --- a/document/book/TM-2026.html +++ b/document/book/TM-2026.html @@ -1999,7 +1999,7 @@ Now suppose defining a Turing Machine that initially has the head on the leftmos

Consider then, inserting jump table instructions to handle the next state transitions. Then a state controller can be mechanically changed into an instruction sequence with embedded jump table instructions without having to run it and observe it. Accordingly, first examine the state diagram for the controller. Take all the sequential state runs, even those of length 1, from the controller, and list their instructions in the same sequence order. Then, after each such sequence, wherever a state has next state transition arcs based on the value of the status register, insert a jump table instruction, so that it jumps to the appropriate instruction sequence.

-

Take for example the TTCA machine two headed string reverse example, this procedure produces the following instruction sequence:

+

Applying this mechanical procedure to the TTCA two-headed reverse string example controller results in:

# Phase 1: Both heads scan right to the EOM pivot @@ -2051,7 +2051,7 @@ Now suppose defining a Turing Machine that initially has the head on the leftmos halt -

The state labels have become addresses into the program tape, and the address of the cell indicated by the head on the first tape is now an Instruction Pointer (IP). In a sense the programmed controller has been replaced by a little Turing Machine of its own. One that controls the head on the first tape, and moves it in response to the control instructions found on the first tape. Such a controller on a processor is called a sequencer.

+

The state labels have become addresses into the program tape, and the address of the cell indicated by the head on the first tape is now an Instruction Pointer (IP). In a sense the programmed controller has been replaced by a little Turing Machine of its own. One that controls the head on the first tape, and moves it in response to the control instructions found on the first tape. Such a controller on a processor is called a sequencer.

By separating the control path from the data path, utilizing an integrated symbol alphabet, replacing states with sequential instructions, and introducing an explicit addressable instruction pointer, the theoretical machine has physically crossed the bridge to conventional computing. The resulting architecture is a stored-program, von Neumann-style machine organization.