Mathematical / Computational Process Algorithm

The steps

1. State the axioms or premises with maximum clarity.
2. Apply the rules of inference rigorously. No assumed steps.
3. Per Recursion: a function that calls itself produces compounding behavior. Use deliberately.
4. Per Emergence: simple rules at sufficient density produce complex behavior. Conway’s Game of Life as the canonical example.
5. Per Gödel: any sufficiently complex system contains true statements unprovable within itself. Acknowledge this in any framework you build.
6. Apply Falsifiability. A proof that cannot be checked is a claim, not a proof.
7. Per the Variable Principle: name what you are assuming. Mathematics is unforgiving of unnamed assumptions.
8. Document the derivation. Per Database step. Show the work.

Articles on this

No articles on this one yet.

From the GFunnel Methodology v5.1 by Cameron Garlick, licensed CC BY 4.0. Steps are reproduced word for word.