Viability of a Recursive Computation Substrate Under Full Noise: Structural Constraints for Noise-Robust Computation
Fuente:
Zenodo
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Recurso digital |
| Sprache: | Englisch |
| Veröffentlicht: |
Zenodo
2026
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866901891460366336 |
|---|---|
| author | Shipkowski, James |
| author_facet | Shipkowski, James |
| contents | <p>This work presents a structural–empirical analysis of computation under sustained perturbation. Rather than treating computation as an operational or performance-defined process, the paper evaluates computation as a structural phenomenon grounded in identity preservation, admissible continuation, irreversibility, and constraint enforcement.</p> <p>The analysis is explicitly <strong>dependent</strong> on the foundational ontology developed in <em>Recursion, Constraint, and Persistence</em>, which derives recursion, admissibility, collapse, and irreversibility from the minimal requirement that identity must persist across transformation. No attempt is made here to justify that ontology independently; all conclusions in this work collapse if those foundations fail.</p> <p>Empiricism in this paper is defined <strong>structurally rather than physically</strong>. Claims are falsifiable with respect to inequalities, bounds, and necessity conditions over abstract state spaces, not through hardware benchmarks, physical noise models, or experimental measurement. The analysis is therefore implementation-invariant and avoids assumptions about speed, efficiency, optimization, intelligence, agency, or physical realization.</p> <p>We show that, under bounded adversarial noise, a recursively constrained substrate remains computationally viable if and only if five conditions hold:<br>(1) identity tolerance exceeds noise magnitude,<br>(2) admissible continuation exists,<br>(3) structural entropy is bounded,<br>(4) constraint violations induce structured collapse rather than undefined behavior, and<br>(5) collapse preserves irreversible history and permits post-collapse continuation.</p> <p>The paper introduces a formal <strong>physical realization bridge</strong>, specifying necessary constraints that any physical system claiming noise-robust computation must satisfy, without asserting that any such system exists or that the framework derives physical law. An appendix demonstrates structural correspondence — not reduction — with quantum error correction, thermodynamic irreversibility, and classical fault-tolerant computation.</p> <p>This work does not propose a new physical theory, computational architecture, or algorithm. Its contribution is to identify minimal, falsifiable structural conditions under which computation can persist under noise, independent of implementation.</p> |
| format | Recurso digital |
| id | zenodo_https___doi_org_10_5281_zenodo_18472036 |
| institution | Zenodo |
| language | eng |
| publishDate | 2026 |
| publisher | Zenodo |
| record_format | zenodo |
| spellingShingle | Viability of a Recursive Computation Substrate Under Full Noise: Structural Constraints for Noise-Robust Computation Shipkowski, James recursive computation noise-robust computation structural empiricism admissibility identity preservation entropy bounds collapse and reintegration fault tolerance quantum error correction (structural) irreversibility computation theory ontology of computation non-teleological systems implementation-invariant analysis <p>This work presents a structural–empirical analysis of computation under sustained perturbation. Rather than treating computation as an operational or performance-defined process, the paper evaluates computation as a structural phenomenon grounded in identity preservation, admissible continuation, irreversibility, and constraint enforcement.</p> <p>The analysis is explicitly <strong>dependent</strong> on the foundational ontology developed in <em>Recursion, Constraint, and Persistence</em>, which derives recursion, admissibility, collapse, and irreversibility from the minimal requirement that identity must persist across transformation. No attempt is made here to justify that ontology independently; all conclusions in this work collapse if those foundations fail.</p> <p>Empiricism in this paper is defined <strong>structurally rather than physically</strong>. Claims are falsifiable with respect to inequalities, bounds, and necessity conditions over abstract state spaces, not through hardware benchmarks, physical noise models, or experimental measurement. The analysis is therefore implementation-invariant and avoids assumptions about speed, efficiency, optimization, intelligence, agency, or physical realization.</p> <p>We show that, under bounded adversarial noise, a recursively constrained substrate remains computationally viable if and only if five conditions hold:<br>(1) identity tolerance exceeds noise magnitude,<br>(2) admissible continuation exists,<br>(3) structural entropy is bounded,<br>(4) constraint violations induce structured collapse rather than undefined behavior, and<br>(5) collapse preserves irreversible history and permits post-collapse continuation.</p> <p>The paper introduces a formal <strong>physical realization bridge</strong>, specifying necessary constraints that any physical system claiming noise-robust computation must satisfy, without asserting that any such system exists or that the framework derives physical law. An appendix demonstrates structural correspondence — not reduction — with quantum error correction, thermodynamic irreversibility, and classical fault-tolerant computation.</p> <p>This work does not propose a new physical theory, computational architecture, or algorithm. Its contribution is to identify minimal, falsifiable structural conditions under which computation can persist under noise, independent of implementation.</p> |
| title | Viability of a Recursive Computation Substrate Under Full Noise: Structural Constraints for Noise-Robust Computation |
| topic | recursive computation noise-robust computation structural empiricism admissibility identity preservation entropy bounds collapse and reintegration fault tolerance quantum error correction (structural) irreversibility computation theory ontology of computation non-teleological systems implementation-invariant analysis |
| url | https://doi.org/10.5281/zenodo.18472036 |