Transitions and Behavior

[2025-12-22 Mon]

1. Definition of TRANSITION

A transition is the execution of an action that maps the system from one internal state to another under a fixed ruleset.¹ (see: Ethics(5))

1.1. Formal

\begin{equation} \tau \in \text{Transitions}(S) := (a_t, x_t) \xrightarrow{a_t} a_{t+1} \end{equation}

2. Elsewhere

2.1. References

2.2. In my garden

Notes that link to this note (AKA backlinks).

Termination Preserves Purity More Reliably Than Adaptation
Purity is a Type Constraint

Footnotes:

Tau Operator: ε xA(x) picks an element x that makes the formula A(x) true. If many exist, it picks one (non-deterministically); if none exist, it picks an arbitrary default, ensuring it always yields a term.