5. A finite physical implementation scheme
5.1 Order-sensitive local operations
An onset in channel can load a trace . A later onset samples that trace through a -then- detector; reversing the order recruits a converse route. Edge detection or refractory logic prevents an onset from counting as its own predecessor. Inputs within a finite coincidence band remain unresolved. Assigning arbitrary identifiers would not establish their temporal order.
One retention component is an RC trace:
The clock variable is local proper time. Propagation paths are finite, switches take positive duration, and prepared states, power and noise margins are required. These are physical dynamical commitments, not an advancing present added to a table.
For , , and threshold , the time constant is . The maximum detectable gap is
At 100 ms, the trace is 0.670320 V; at 300 ms, it is 0.301194 V. Allowing each of and to vary by , and the threshold from 0.38 to 0.42 V, gives a minimum short-gap trace of 0.641970 V and a maximum long-gap trace of 0.336743 V. Both classifications retain a margin. Initial capacitor energy is , which is not the energy requirement of the entire device.
Figure 2. The chosen finite trace and threshold establish component margins. They do not set a universal human integration window or constitute a completed order circuit.
Standard electronic components already implement leakage, integration and finite retention in leaky-integrate-and-fire circuits (Rozenberg et al., 2019). Building the full architecture and integrating its output into a person's interpretation are further claims. Trace survival through 100 ms does not itself establish perceived order: auditory fusion demonstrates the difference. The detector preserves one necessary type of information rather than supplying the entire experience.
5.2 Source order and calibrated order
Source separation and delivery delays produce arrival separation
Let occur at 0 ms with 80 ms delay, and at 50 ms with 10 ms delay. Then arrives at 60 ms and at 80 ms. Arrival order is -before-. Learned estimates can instead assign received events the calibrated times and recover -before- once both inputs have arrived. Correct calibration is stipulated in this computational example; a real calibration carries uncertainty.
The operation uses received signals and retained estimates, not true source timestamps supplied as an oracle. It receives no future signal early and reverses no cause. Motor-sensory recalibration experiments show that judged order can change after learned delay while physical source order remains fixed (Stetson et al., 2006). A common strictly increasing rescaling cannot reverse the order of the same events. A rate-only account with a fixed order readout is therefore insufficient for that contrast.
5.3 Representation, realization and actual use
Five explanatory levels remain distinct. A typed graph represents operations. A finite circuit scheme supports physical admissibility. Enactment requires the relevant operations actually to occur within the person. A report can follow from that activity. Under the constitutive identity, experience is the qualifying complete enactment itself.
A computational record can expose directed order, source modes and optional retrieval without manufacturing a listener. Attaching an order detector does not automatically recruit its state into the person's uptake. That connection is an empirical integration obligation. It is not an unexplained experiential conversion left over after complete enactment.
Nor must the historical representation run in a second time. Under a monotone reparameterization ,
The physical process and dimensionless interval remain the same. Derivatives, indices and intervals express physical relations; they do not independently add a flowing clock. The construction preserves physical dynamics and change.
Published source: Experienced Temporal Passage. Read the original PDF alongside the web treatment.