Language-model reasoning alternates between sustained activities and local operations. We study how this temporal structure predicts continuation and the computation needed to analyze it. T/E/S combines text, local events, and spans of activity. Across reasoning and information-seeking tasks, events and spans improve next-outcome prediction in 70 of 76 evaluation groups for a Transformer and 74 of 76 for Qwen with LoRA. Span duration and preceding events are associated with transitions, and retaining event history across span boundaries improves prediction. We formulate budget-allocation counting and action-conditional continuation queries, prove counting hardness under explicit encodings, and derive conditions for affordable decision certification. In finite-process experiments, bounds that cancel shared continuation mass recover the same optimal actions as full dynamic programming while reducing mean inference CPU time by 77.7%. On 71 held-out HotpotQA and MuSiQue questions, a compact structural observer improves prediction of whether a fixed inference procedure finishes within a CPU allowance: Brier loss falls from 0.0836 to 0.0756. An annotation audit identifies substantial errors in that observer, separating this computational result from semantic validation of its features.
Figures & tables
Figure 1. T/E/S separates a local check from the surrounding derivation. Modes can recur; only the observed prefix is available for prediction.
Inputs
Transformer
Qwen
Text
0.851
0.698
Text+events
0.805
0.685
Text+spans
0.734
0.603
Text+events+spans
0.719
0.598
Table 1. Input ablation across corpus solvers: 282 validation questions. Weighted multitask loss; lower is better.
Method
CPU time, ms ↓
Full probability computation
12.94
Early selection with separate bounds
5.62
Early selection with shared continuations
2.88
Table 2. Action selection on 404 queries to finite-process models. All methods select the same actions as full computation.
Predictor inputs
Brier ↓
Counters and length
0.0926
Text + counters
0.0836
Text + counters + observed spans
0.0767
Text + counters + observed E/S
0.0756
Table 3. Predicting inference availability for Qwen3.6 retrieval: 71 HotpotQA/MuSiQue questions. Lower Brier loss is better.
Rule
F1 ↑
Tokens
CPU, ms
Always answer
0.4339
561
0.0
Always retrieve
0.5337
1410
0.0
Direct text control
0.5187
1369
271.8
Inference selected by T
0.5184
1372
276.8
Inference selected by T/E/S
0.5192
1372
278.8
Matched random calls
0.5192
1371
281.2
Table 4. Qwen3.6 retrieval on 71 HotpotQA/MuSiQue questions: F1, full output tokens, controller CPU. Averages include four budgets.
Appendix figures & tables1 asset
Supplementary material from the paper’s appendix.
Appendix
Model
NLL
Struct.
Length/END
Semi-Markov
0.550
0.159
0.289
Explicit memory
0.546
0.159
0.315
GRU
0.529
0.160
0.272
Neural Hawkes
0.533
0.154
0.269
Appendix
Table 5. Process approximations: MATH500, GPQA Diamond, BBH. NLL in nats/step; two energy scores. Lower is better.