-
Notifications
You must be signed in to change notification settings - Fork 0
Research Basis and Limits
CPCF borrows definitions, algorithms, and distinctions from several research areas. A reference supports the limited formal question encoded by a check; it does not establish that a software collective has the physical properties of a chemical system, an organism, or a phase of matter.
The implementation's concept-to-code mapping identifies the executable location, representative tests, implementation status, and explicit non-claim for every supported concept. A result is only as broad as that mapping, the declared input set, and the stated computational bound.
| Area | CPCF use | Important limit |
|---|---|---|
| Chemical organization and open reaction networks | Closed target-bound subsets, exact maintenance balances, and boundary/resource accounting. | No kinetic, equilibrium, stability, entropy-production, or thermodynamic inference. |
| RAF systems | Food-supported, catalytic, inhibitor-aware, and strictly prior generative layers. | Not chemical equivalence or universal catalysis; several enumerations have declared size bounds. |
| Petri nets and structural analysis | Siphons, cuts, enablement sets, occurrence prefixes, and reachability constraints. | Not unbounded reachability, persistence, or general network controllability. |
| Network calculus | Exact finite-horizon comparisons for validated piecewise-rational curves. | No stationarity, queue identity, backlog, or delay claim without the required signed curves. |
| Collective coordination studies | Separation of coordination, diversity, exposure, and individual ability. | Not a universal topology law or proof of independence from labels. |
| Strong nondeterministic planning | Branch-safe finite-horizon planning across declared outcomes. | No fairness, eventual-success, or promotion of hypothetical outputs to evidence. |
| Target-trial design | Explicit eligibility, strategies, time zero, outcomes, and analysis bindings. | No certification of causal identification or statistical methodology. |
| DSSE and supply-chain provenance | Protected payload verification and provenance-bound build evidence. | DSSE does not solve key management; CPCF makes no hardened-builder claim without separate proof. |
Some algorithms report unknown beyond a declared bound rather than extrapolating. For example,
the native v0.6 generalized RAF enumeration and certain structural searches are exact only within
their stated input sizes. Perturbation and planner logic likewise has declared coverage gaps. This
is intentional: a bounded result should remain bounded rather than being narrated as a universal
theorem.
- Research basis and non-claims
- Concept-to-code-to-test-to-nonclaim mapping
- Formal model
- Release readiness and remaining gates
See Operational Profile and Scientific Scope for the practical interpretation of these limits.