From: Thomas Walker Lynch Date: Sun, 12 Jul 2026 16:57:16 +0000 (+0000) Subject: . X-Git-Url: https://git.reasoningtechnology.com/D_10.png?a=commitdiff_plain;h=9a4f43ecec4120f7f4c9ace459694296ac83f49a;p=TM-2026 . --- diff --git a/document/TM-2026.html b/document/TM-2026.html index 2dbcea1..c246a7f 100644 --- a/document/TM-2026.html +++ b/document/TM-2026.html @@ -598,48 +598,6 @@ Mathematically, a Turing Machine tape can be expressed as a path graph. However, a tape model and a path graph model imply different ontological contexts. The neighbor property of a Turing Machine tape cell specifically informs a clock driven atomic step function where to place the machine head next. The machine only has defined meaning at the state points on the programmed controller. In contrast, a path graph exists in the wider context of graph theory. A path graph has edges and each edge can be focused on, said to be traversed over, and given general properties. These are things we explicitly excluded in the tape definition. If we were to move the tape from the context of the machine and into the more abstract mathematical context by modeling the tape with a path graph, then we would do so for the purpose of analyzing the tape, which is a higher order and more abstract activity. However, in the current exercise we are not reaching towards the more abstract; rather, we are reaching in the other direction, towards machine architecture.

-

Machine

- -

The customer programmable components:

-
    -
  1. a custom predefined read only data alphabet
    2. -
  2. a custom predefined immutable programmed controller with states that can be referenced
    3. -
  3. a custom predefined constant initial state reference
    4. -
  4. a custom predefined constant halt state reference
    5. -
- -

The immutable structural components:

-
    -
  1. a read only empty symbol that is distinct from any symbol in the data alphabet. The examples in this document use the symbol '□'
    2. -
  2. a read only control alphabet for this base model, consisting of the one symbol leftmost
    3. -
  3. a read writable current state reference variable, which points into the custom predefined program controller
    4. -
  4. a fixed hardware halt state comparator
    5. -
  5. a tape transport unit, TTU, from which tapes can be mounted and unmounted. Multiple TTUs can be plugged in. Each TTU contains: -
      -
    1. a read/write head
      2. -
    2. a single symbol FIFO read data buffer, written by the TTU, read by the programmable controller
      3. -
    3. a single symbol FIFO status buffer, written by the TTU,, read by the programmable controller
      4. -
    4. a single symbol FIFO command buffer, written by the programmed controller, acted upon immediately by the TTU.
      5. -
    -
    6. -
- -

The fixed logic internal to the machine:

-
    -
  1. a constant executor where each step of the procedure can be referenced by number
    2. -
  2. a read/writable/incrementable executor step counter
    3. -
  3. a reset button that activates logic that initializes the machine
    4. -
  4. a read only clock to synchronize control and to cause counting until the halt state is reached
    5. -
- -

Accessories:

-
    -
  1. tapes, as described in a prior section
    2. -
  2. a Universal Turing Machine package, consisting of the Universal Turing Machine programmable controller and auxiliary alphabet, which comes with tapes containing example programs
    3. -
- -

Each highlighted term is a short name for the associated item.

-

The customer programmed components

The customer programmed portion of the programmed control consists of:

@@ -680,7 +638,7 @@
  • the reset control line
  • the clock
  • multiple comparators
    • - +

    The comparators are used to used to match the identifier with a the values read from each of the buffers. Note that if the same next state is specified for the same start state, then it is the same as though the identifiers are in disjunction. Also the no-op command to create conjunctive decisions. Hence as a shorthand notation arcs can be labeled with propositions made from the buffer values.

    @@ -715,7 +673,24 @@ -

    Upon entering a state, the value under the head is copied to the TTU side of the read buffer. The arc propositions are evaluated against this value. + + + + + + + + + + + + + + + + + +

    The distinct empty symbol can be any symbol that is excluded from the alphabet. Only instances of alphabet symbols or the empty symbol are permitted to be written to the tape. @@ -750,6 +725,49 @@

    +

    Machine

    + +

    The customer programmable components:

    +
      +
    1. a custom predefined read only data alphabet
      2. +
    2. a custom predefined immutable programmed controller with states that can be referenced
      3. +
    3. a custom predefined constant initial state reference
      4. +
    4. a custom predefined constant halt state reference
      5. +
    + +

    The immutable structural components:

    +
      +
    1. a read only empty symbol that is distinct from any symbol in the data alphabet. The examples in this document use the symbol '□'
      2. +
    2. a read only control alphabet for this base model, consisting of the one symbol leftmost
      3. +
    3. a read writable current state reference variable, which points into the custom predefined program controller
      4. +
    4. a fixed hardware halt state comparator
      5. +
    5. a tape transport unit, TTU, from which tapes can be mounted and unmounted. Multiple TTUs can be plugged in. Each TTU contains: +
        +
      1. a read/write head
        2. +
      2. a single symbol FIFO read data buffer, written by the TTU, read by the programmable controller
        3. +
      3. a single symbol FIFO status buffer, written by the TTU,, read by the programmable controller
        4. +
      4. a single symbol FIFO command buffer, written by the programmed controller, acted upon immediately by the TTU.
        5. +
      +
      6. +
    + +

    The fixed logic internal to the machine:

    +
      +
    1. a constant executor where each step of the procedure can be referenced by number
      2. +
    2. a read/writable/incrementable executor step counter
      3. +
    3. a reset button that activates logic that initializes the machine
      4. +
    4. a read only clock to synchronize control and to cause counting until the halt state is reached
      5. +
    + +

    Accessories:

    +
      +
    1. tapes, as described in a prior section
      2. +
    2. a Universal Turing Machine package, consisting of the Universal Turing Machine programmable controller and auxiliary alphabet, which comes with tapes containing example programs
      3. +
    + +

    Each highlighted term is a short name for the associated item.

    + +

    The TTU