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

This entry was posted in Arithmetization, C.S. Peirce, Gödel 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 and tagged , , , , , , , , , , , , , , , , . Bookmark the permalink.

Leave a comment

This site uses Akismet to reduce spam. Learn how your comment data is processed.