Theory of Computational Irreversibility in Self-Parameterized Function Chains
Abstract
Comprehensive theory establishing three levels of computational irreversibility in self-parameterized function chains:- Theorem A: Exponential inverse complexity Ω(mⁿ) - Theorem B: Absolute irreversibility through information destruction (P = 0)- Theorem C: Tunable complexity framework Full mathematical proofs included. Preprint. Version 3.0.
Fields of Study & Subjects
Computability
Logic
AI Algorithms
Cellular Automata and Applications
Quantum Computing Algorithms and Architecture
Publication details
- Journal / source
- Zenodo (CERN European Organization for Nuclear Research)
- Publication date
- 4 January 2026
- Language
- EN
- Document type
- Preprint