Claims Ledger
What is demonstrated, what is simulated, what is hypothesis, and what is roadmap.
This ledger exists because the distinction between a language-design claim, a simulation result, a physical-substrate hypothesis, and a roadmap item is not cosmetic. It determines what anyone should believe about SymLan.
Demonstrated - specification or language-design claim visible in the written artifacts | Simulated - reference-path claim requiring reproducible scripts/logs | Hypothesized - plausible but not validated | Roadmap - planned or conceptual
v0.3 Claims Ladder
| Claim | Status | Evidence / Limit |
|---|---|---|
| SymLan can express declared, pending, and resolved symbolic values. | Demonstrated | Language-design claim present in the specification and examples. |
| SymLan can describe attractor-backed vocabulary registration and delayed vocabulary use. | Demonstrated | Present in syntax examples and Research Preview v0.3. |
| A reference simulator can generate candidate attractor basins and attach compact identifiers. | Simulated | Requires clean public reproducibility package before stronger claims are made. |
| Readout operators such as PiAPlus can be evaluated by collision, entropy, replay, and provenance criteria. | Simulated | Validation framework is defined; independent implementation remains needed. |
| SymVoc can serve as a portable file or registry format for resolved vocabularies. | Hypothesized | Format and tooling remain early. |
| Physical oscillator substrates can reproduce the reference simulation behavior. | Hypothesized | Not claimed as solved. Active research target. |
| A Tower-style registry can coordinate symbolic vocabularies across labs, agents, or models. | Roadmap | Governance, deployment, and adoption remain open. |
Non-Claims
- Physical hardware currently runs SymLan.
- Physical phase-coherent substrate support is solved.
- SymLan replaces existing programming languages or transformer models.
- The Tower registry is deployed.
- Symbolic grounding is solved.