This paper formalises a structural limitation of isolated recursion within the Paton admissibility framework. A single recursive node operating without sufficient relational constraint cannot guarantee bounded amplification under sustained load. Closed recursion intersects a tolerance boundary, whereas distributed recursion preserves admissible continuation. The analysis introduces no new operators and does not modify the foundational admissibility spine (Gate → Datum → ℘). It clarifies recursive load behaviour at Tier-6 and demonstrates that the insufficiency of isolated recursion follows from structural inequality conditions rather than metaphorical interpretation.
Andrew John Paton (Fri,) studied this question.