Reflection On Recursion • 2

Turning to the form of a simple recursive function f(n) = m(n, f(p(n))), the clause we used to define it earns the title of “syntactic recursion” due to the way the function name ``f" occurring in the defined phrase ``f(n)" re‑occurs in the defining phrase ``m(n, f(p(n)))".

Simple Recursion

It needs to be clear there is no circle in the definition — each instance of the type f is defined in terms of an instance one step simpler until the base case is reached and fixed by fiat.  Instead of a circle then we have two gyres, the gyre down via the precedent function p and the gyre up via the modifier function m.

Resources

cc: Academia.eduCyberneticsLaws of FormMathstodon
cc: Research GateStructural ModelingSystems ScienceSyscoi

#arithmetization, #c-s-peirce, #godel-numbers, #higher-order-sign-relations, #inquiry-driven-systems, #inquiry-into-inquiry, #logic, #mathematics, #quotation, #recursion, #reflection, #reflective-interpretive-frameworks, #semiotics, #sign-relations, #triadic-relations, #use-and-mention, #visualization