PhilArchive
open access
Logical-arithmetic entropy and the principle of maximum entropy Irreversibility and computational complexity
Maximum entropy is a way to model irreversibility. Considering that irreversibility is a characteristic of computation due to logical-arithmetic entropy, this principle could be applied to the algorithms and/or general recursive functions affected by it.
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Shannon entropy: a rigorous notion at the crossroads between probability, information theory, dynamical systems and statistical physics#398849
- Maximum Entropy and Its Alignment with the Three Universal Laws of Nature#731699
- The Orientation Boundary for Step-Duplicating Recursors: A Machine-Checked Structural Theory of Termination Proofs#1155079
- Entropic Collapse in Recursive Cognitive Systems: An Information-Theoretic Argument for Exogenous Truth Injection#88341
- There’s Plenty of Boole at the Bottom: A Reversible CA Against Information Entropy#700935
Record · ID 96886
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive