After Turing: The Fold Machine - An Exact, Parameter-Free and Machine-Closed Derivation of Classical Computational Science from Smithian Fold Theory

After Turing: The Fold Machine, version 1.3.0, preserves the exhaustive Classical Computation derivation while publishing the full-field roadmap and integrating its exact native-model headline theorems with Maria Smith's authorship and the Ernos Labs public-science mission. For every admitted positive finite description depth k, the native Fold Busy-Beaver function is BB_F(k)=k. Exact evaluation emits the same unique lawful trace checked by the proof system, giving P_F=NP_F in the admitted Fold grammar. Every admitted depth-k Fold circuit requires its k forced transition edges; all 16,384 subsets of the depth-14 edge carrier were exhausted and only the full support survived. These native-model theorems are not silently exported to external machine grammars. The frozen inventory contains 116 dependency-ordered laws, 29,696 generated structural candidates, 116 unique survivors, 116 depth-independent certificates, 464 adverse controls and 116 implementation-distinct validations. The V1/V2 ownership audit closes 134 of 134 atomic Classical Computation obligations. Version 1.3 publishes the continuing complete-field programme across formal computation, computability, complexity, algorithms, semantics, distributed computation, cryptography, learning and scientific computation without replaying or weakening the admitted inventory. Source, candidate products, decision vectors, controls, validators and receipts remain public so scientific authority rests on inspectable evidence rather than paywalls, proprietary oracles, credentials, capital or consensus.