Formative Propagation Grammar
Asks whether a formed medium can turn a perturbation into a route. First experiments are spider-web construction and vibration reanalysis, then a tiny mechanical simulator. Not a laboratory claim. Not universality.
Working drafts · v0.1 · 20–21 August 2026
Formative Field Computing
History-responsive wave recruitment, conditioned return paths, and a candidate grammar for formed propagation media.
Claim boundary: These are conceptual and experimental research frameworks. They do not claim machine consciousness, new fundamental physics, biological equivalence, a universal law, or demonstrated superiority over conventional computing. Snapshot closure is a successful result.
The address may be a condition rather than a location.
The question this packet is for
Can a consequence of prior formation become a condition-sensitive future route without encoding the destination explicitly?
structured perturbation × formed medium × current susceptibility × formation history → selectively recruited continuation
If the recruited response changes the medium, later copies of the same perturbation meet a different admissibility landscape. That is the recursion under test. It is not yet a result.
The stack, as currently named
Formative Field Computing
A structured field recruits locally persistent elements by present state, neighborhood, susceptibility, and history rather than by per-element address. Fieldborne formation matters only if it changes later field response after fair state matching.
Conditional Reconstructive Recruitment
Preserve broadly, activate selectively, expand when locally justified, retain a return path. A return path is navigation, not evidence. Activation is not promotion.
Bridge note
FFC and bounded reconstruction are complementary layers of one organizational problem: large available state is not large active state. The shared test is local reactivation without a supplied destination.
What is currently claimed, and what is not
Supported by constructed work: large persistent state and small active state can be distinguished; snapshot closure and bounded reconstruction are dual searches around a Minimum Sufficient Present; several magnetic and wave-computing ingredients required by FFC already exist in other laboratories.
Proposed: a purpose-built field grammar can recruit by retained state; fieldborne formation can leave residue that changes later response after present-state controls; a return residue can locate a dormant pathway without encoding the destination; FPG is a testable grammar of conditioned recruitment through formed media.
HOLD: machine consciousness; cross-substrate formative motif; FFC outperforming conventional addressing or existing reservoir computing; CRR more efficient than strong retrieval at equal cost.
First experiment named, not yet run: FPG-EXP-001 — does recent construction history improve next-action prediction in the Johns Hopkins 2021 spider web-building archive after current geometry is included?
What this page is not
Neighbor papers, solver screenshots, and orientation diagrams sitting in the local working folder are not part of this public packet. They have not been promoted into FFC evidence.
A commit is not a demonstration. Publishing a working draft is an invitation to attack the record, not a claim that the grammar has been found.