~/tedtes/writing/math-foundations-for-reasoning-models

~/writing/math-foundations-for-reasoning-models $ ls

Computation as State Transition

Finite Control

Finite control is the system's finite internal mode that helps select which transition rule applies next.

~/writing/math-foundations-for-reasoning-models $ cat topic.md

What Is Finite Control?

Definition

Finite control is the system's finite internal mode that helps select which transition rule applies next.

It does not store the whole memory.

It does not inspect the whole tape at once.

It keeps track of the system's current internal control state.

Finite control = finite internal control state used to guide rule selection


Finite Control vs Tape

In the tape model, the system has:

  • tape contents
  • current tape position
  • read, write, and move operations
  • finite control

The tape stores symbols.

The current position determines which tape cell is active.

Finite control stores the system's current internal mode.

Example:

Tape: [1] [0] [1]
          ^
Current control state: scanning

The tape contains memory.

The control state tells the system what mode it is currently in.

Tape stores symbols. Finite control stores the current internal mode.


Control State vs System State

Control state is not the same as the full system state.

Control state is one part of the system's current situation.

Example:

Control state: scanning
Tape: [1] [0] [1]
Position: second cell

The control state is:

scanning

But the full system situation includes more than scanning.

It also includes the tape contents and current position.

Control state is one part of the system state, not the whole state.


Finite Set Of Control States

Finite control has a limited number of possible control states.

Example:

Control states: {scanning, returning, halted}

At any moment, the system is in one of those control states.

Example:

Current control state: scanning

Finite control means the number of control states is finite.

It does not mean the number of possible tape contents is finite.

Finite control has finitely many internal modes, even if memory can contain many possible values.


Control State As Context

The same read symbol can lead to different behavior depending on the current control state.

Example:

Current control state: scanning
Read symbol: 0
Action: write 1, move right, go to returning

Current control state: returning
Read symbol: 0
Action: write 0, move left, go to scanning

The read symbol is the same: 0.

The action is different because the control state is different.

Control state gives context to the symbol being read.


Behavior Depends On Control State And Read Symbol

The next action is selected using both:

  • the current control state
  • the symbol read from the current tape position

Example:

(current control state, read symbol)
  -> (write symbol, move direction, next control state)

Concrete example:

(scanning, 0) -> (write 1, move right, next state returning)

This means:

  • if the control state is scanning
  • and the read symbol is 0
  • then write 1
  • move right
  • change control state to returning

The current control state and the read symbol together determine which rule applies.


Finite Control vs Transition Rule

Finite control and transition rules are related, but they are not the same thing.

Finite control is the current internal mode.

A transition rule defines what to do for a given control state and read symbol.

Example:

Current control state: scanning
Read symbol: 0

Rule:
(scanning, 0) -> (write 1, move right, next state returning)

The control state is scanning.

The rule uses scanning and 0 to select the next action.

Finite control provides internal context. Transition rules define valid next steps.


Example

Suppose the finite control has two states:

{scanning, returning}

Rules:

(scanning, 0) -> (write 1, move right, next state returning)
(scanning, 1) -> (write 0, move left, next state scanning)
(returning, 0) -> (write 0, move right, next state returning)
(returning, 1) -> (write 1, move left, next state scanning)

If the current situation is:

Control state: scanning
Tape: [1] [0] [1]
          ^
Read symbol: 0

Then the applicable rule is:

(scanning, 0) -> (write 1, move right, next state returning)

The next step updates:

  • the tape symbol
  • the current position
  • the control state

Finite control helps select what happens next, but the full step also involves tape and position.


Why Finite Matters

The word finite means the system has only a limited set of internal control states.

Example:

{scanning, returning, halted}

The system cannot invent a new control state unless it was already part of the defined set.

This matters because it separates:

  • finite internal control
  • potentially large or extendable memory

The system may have a small number of control states while still using tape memory to store many symbols.

Finite control is limited, but memory can still provide a larger workspace.


No Understanding Required

Finite control does not understand the symbols it processes.

It only follows defined rules.

Example:

(scanning, 0) -> (write 1, move right, next state returning)

The system does not need to know what 0, 1, scanning, or returning mean to a person.

It only needs distinguishable symbols and defined rules.

Finite control guides computation without awareness or interpretation.


Key Properties

  • Has a finite number of control states
  • Tracks the current internal mode
  • Does not store the whole tape
  • Helps select transition rules
  • Works with the read symbol
  • Can change from one control state to another
  • Does not require understanding

Why This Matters

Finite control enables:

  • conditional behavior
  • structured rule selection
  • context-dependent computation
  • different behavior for the same symbol in different control states

Without finite control, the system would have less internal context.

With finite control, the system can behave differently depending on where it is in the process.

Finite control gives computation internal context.


Final Summary

  • Finite control is the system's finite internal mode.
  • It consists of a finite set of control states.
  • Control state is part of the system state, not the whole state.
  • Finite control does not store the whole tape.
  • The next action depends on control state and the symbol read from memory.
  • A transition rule maps control state and read symbol to write, move, and next control state.
  • Finite control provides context for rule selection.
  • Finite control does not require understanding.

~/writing/math-foundations-for-reasoning-models $ open

Continue the series.

Configuration