Computational · Paper · 2026

Autopoietic Project Generation

Zenodo

Catalog Row185
Citation KeyFriedman2026AutopoieticProjectGeneration185
Paper FolderAvailable

Overview

Extracted from the local paper documentation when available.

template autopoiesis is a combinatoric grammar that deterministically generates whole runnable projects — not files or snippets, but complete, independently testable child repositories with their own kernel source, tests, analysis entry point, and manuscript. A single integer seed plus a grammar of orthogonal slots (primitive domain, analytical track, section set, and three presentation/provenance slots) selects one child from a combinatoric product space of 360 nominal (45 content-distinct) configurations, via a SHA-256 digest of the seed and slot identity — with no random-number generator anywhere in the expansion path. Project generators routinely claim completeness, determinism, and traceability without making any of the three independently checkable. This exemplar treats each claim as a structural property to verify rather than a rhetorical one to assert: verify child() recomputes a

autopoiesiscombinatoric grammardeterministic generationproject synthesisreproducible researchinfrastructure automation

Use Notes

Concise findings and methods pulled from README/SKILL documentation.

Findings / Concepts
  • autopoiesis
  • combinatoric grammar
  • deterministic generation
  • project synthesis
  • reproducible research
Methods / Techniques
  • Not yet summarized.

Citation

Plain-text citation for quick reuse.

Friedman, Daniel Ari. 2026. Autopoietic Project Generation. Zenodo. DOI: 10.5281/zenodo.21227869. URL: https://doi.org/10.5281/zenodo.21227869.

Primary source Documentation Source repository BibTeX

Related in Computational

Other catalogued works in the same domain.