Recursive Distinction Dynamics — Project Hub

Objective

Define RDD as a usable formalism: minimal primitives, falsifiable claims, examples, counterexamples.

Scope

• Atoms (definitions): Distinction, 𝓓 (operator), Π (persistence), Φ (coherence field), Pₜ (partition state), Lₜ (graph geometry), 𝓒 (complexity cost).
• Molecules (syntheses): time-as-recursion-index, decoherence-as-rejoin, gravity-as-coherence, determinism vs agency under Π−λ𝓒.
• Evidence: toy models, worked examples, reading extracts.
• Exclusions: metaphysical guarantees; claims without operational tests.

Start here

• RDD — Distinction (Definition)
• RDD — Distinction Operator (𝓓)
• RDD — Persistence Functional (Π)
• RDD — Coherence Field (Φ)
• RDD — Open Questions

Latest changes

Atoms (definitions)

• RDD – Distinction (Definition)

Molecules (short syntheses)

Claims under test

Experiments / examples

Genealogy / context

Reading tie-ins

Tasks

Changelog

Working rules

• One atom = one definition; include a short test or counterexample.

• One molecule = one claim; include assumptions and failure cases.

• Tag with atom, molecule, or claim. Set status: seed|draft|stable|canonical.

• Record changes in the note; don’t delete—deprecate with a pointer to the replacement.