Navigation Without Narration: Constraint, Legibility, and the Limits of Execution Architectures
Fuente:
Zenodo
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Recurso digital |
| Lingua: | inglese |
| Pubblicazione: |
Zenodo
2026
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866902205000318976 |
|---|---|
| author | Reidpath, Daniel |
| author_facet | Reidpath, Daniel |
| contents | <p>Two representational architectures encoding the same constraint can exhibit a systematic directional asymmetry in legibility. Translation from a compact, <em>description optimised </em>architecture into an expanded, <em>execution optimised</em> architecture is mechanically tractable. The reverse---recovering a surveyable, epistemically usable description from the execution architecture---is structurally unavailable when two conditions jointly obtain: many-to-many encoding, and semantic structure realised as distributed causal process rather than explicit representation. The unavailability is not primarily a matter of computational difficulty. It arises either because information required for canonical recovery is lost at encoding, or because no privileged description was ever encoded in the execution architecture in the first place, together with the absence of a self-narrating interpretive key in the execution architecture itself. The argument is grounded in the causal container framework, which identifies circumscription as the condition for epistemic access. Execution architectures preserve the causal pathway while destroying the circumscribability that makes it legible. This asymmetry has been identified in the relationship between symbolic proof and tensor geometry in large-scale neural networks. The present paper argues that the same structural conditions arise independently in the relationship between Turing machine encodings and Conway’s Game of Life. The two cases support a general result: where the two conditions jointly obtain, the encoding from <em>description optimised</em> to <em>execution optimised</em> architecture functions as a one-way epistemic gate. Two further features---dimensional expansion and loss of privileged description level---typically accompany execution architectures but are not necessary for the asymmetry. The paper defends a philosophical thesis about representational opacity, not a formal result. Its force is explanatory and conceptual.</p> |
| format | Recurso digital |
| id | zenodo_https___doi_org_10_5281_zenodo_19056586 |
| institution | Zenodo |
| language | eng |
| publishDate | 2026 |
| publisher | Zenodo |
| record_format | zenodo |
| spellingShingle | Navigation Without Narration: Constraint, Legibility, and the Limits of Execution Architectures Reidpath, Daniel Representational opacity Epistemic asymmetry Causal containers Execution architectures Computational opacity <p>Two representational architectures encoding the same constraint can exhibit a systematic directional asymmetry in legibility. Translation from a compact, <em>description optimised </em>architecture into an expanded, <em>execution optimised</em> architecture is mechanically tractable. The reverse---recovering a surveyable, epistemically usable description from the execution architecture---is structurally unavailable when two conditions jointly obtain: many-to-many encoding, and semantic structure realised as distributed causal process rather than explicit representation. The unavailability is not primarily a matter of computational difficulty. It arises either because information required for canonical recovery is lost at encoding, or because no privileged description was ever encoded in the execution architecture in the first place, together with the absence of a self-narrating interpretive key in the execution architecture itself. The argument is grounded in the causal container framework, which identifies circumscription as the condition for epistemic access. Execution architectures preserve the causal pathway while destroying the circumscribability that makes it legible. This asymmetry has been identified in the relationship between symbolic proof and tensor geometry in large-scale neural networks. The present paper argues that the same structural conditions arise independently in the relationship between Turing machine encodings and Conway’s Game of Life. The two cases support a general result: where the two conditions jointly obtain, the encoding from <em>description optimised</em> to <em>execution optimised</em> architecture functions as a one-way epistemic gate. Two further features---dimensional expansion and loss of privileged description level---typically accompany execution architectures but are not necessary for the asymmetry. The paper defends a philosophical thesis about representational opacity, not a formal result. Its force is explanatory and conceptual.</p> |
| title | Navigation Without Narration: Constraint, Legibility, and the Limits of Execution Architectures |
| topic | Representational opacity Epistemic asymmetry Causal containers Execution architectures Computational opacity |
| url | https://doi.org/10.5281/zenodo.19056586 |