Answers are grounded in this paper and cite their sources.
Volume develops a causal order framework for clock records, indicating constraints on external time accessibility.
This volume develops Ontology of Transition, a transition-first framework in which causal events, rather than static objects or a presupposed continuous time parameter, form the primitive structure of description. Part I represents a system history as a locally finite causal partial order. Internal time is defined as an additive functional of a system’s own transitions, whereas accessible external time is reconstructed from a physical record of a selected clock process delivered through a potentially noisy, delayed, lossy, or aggregating channel. The framework separates causal order, clock readings, work, entropy production, and information-theoretic distinguishability as distinct functionals of a common transition history. It also operationalizes objecthood by distinguishing stable macro-regimes, or object types, from persistent individual realizations, or object tokens. Part II derives quantitative limits on clock reconstruction and identifiability. For an erasure channel with known tick count, the exact minimax mean-squared reconstruction error is npσ². When the tick count is unknown and calibration is deterministic, an additional counting lower bound is obtained. For an aggregating channel, the source calibration law and channel loss rate are identifiable only up to a one-parameter orbit generated by geometric compounding; accordingly, the rate of external time is gauge unless provenance metadata are available. The precision of a physical reading register is further constrained by a thermodynamic uncertainty relation. Object recognition exhibits a sharp critical loss rate, above which rapidly changing object tokens dissolve while frozen tokens remain recognizable. Part III establishes a thermodynamic lower bound on the renewal of reusable clock records. For a finite classical information-bearing footprint reset isothermally without accessible correlated side information, the average renewal work satisfies β⟨Wrenew⟩ ≥ RKclock(D) ≥ R(D), where RKclock(D) is the indirect rate-distortion function induced by the physical delivery channel. Closed-form attainable bounds are derived for symmetric and erasure-and-substitution channels; target distortions below the channel’s Bayes risk are shown to be unattainable at any reset-work budget. A sequential-clock result shows that asymptotic renewal cost is governed by the entropy of unpredictable innovations rather than by the number of ticks. Together, the three parts distinguish channel information loss, register precision, and memory-renewal work as mutually irreducible constraints on physically accessible external time. All principal quantitative results are supported by numerical verification, with the rate-distortion closed forms agreeing with a Blahut-Arimoto solver to machine precision.
No takes yet. Share an insight, caveat, or question.
Alexander Vityaz (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: