Skip to main content

Write a PREreview

Finite information loss, channel capacity and exact reversibility

Posted
Server
Zenodo
DOI
10.5281/zenodo.24339200

Reversibility is exactly singleton predecessor fibres. Downstream maps cannot reopen closed source distinctions. Finite channel capacity retains every greatest zero-error code. Maria Smith develops complete distinction ledgers, predecessor recovery, exhaustive code enumeration, tied maximum families, exact relational composition and arbitrary finite successor proofs in Smithian Fold Theory. The paper includes the mathematical arguments and pinned V3/V4 correspondence, 339 distinct empty-axiom audited declarations, two complete1024-form grammars and portable exact-output reproduction. Correspondence: Maria.smith.sftoe@gmail.com. SFT community: Discord invitation.

You can write a PREreview of Finite information loss, channel capacity and exact reversibility. A PREreview is a review of a preprint and can vary from a few sentences to a lengthy report, similar to a journal-organized peer-review report.

Before you start

We will ask you to log in with your ORCID iD. If you don’t have an iD, you can create one.

What is an ORCID iD?

An ORCID iD is a unique identifier that distinguishes you from everyone with the same or similar name.

Start now