rewriting-systems

Typed DPOI graph‑rewriting engine in C for recursive metagraphs with deterministic local scheduling, atomic snapshots, QCA‑ready.

Mathematics that can be rebuilt — a finite mathematical framework for reconstructing theorem systems under failures, with a universal continuation classification by canonical normal forms, constructive distinguishing continuations, bounded-width algorithms, and reproducible verification — Shunyaya Theorem Reproducibility Framework.

2-tag system conjugate to De Mol (2008) computing the accelerated Collatz map T. Halting of B^n is open (≡ 3n+1). Proofs, cycle catalog to length 30, binary analogues. MEPhI Hod Mysli 2026.