Reflection On Recursion • Discussion 1

Re: Reflection On Recursion • 1
Re: Laws of FormJohn Mingers

JM:
This is a very important and interesting topic.  I think you should consider the relationship to self‑reference, indeed are they really the same thing?

Also the work of Maturana and Varela on autopoiesis and the neurophysiology of cognition which also has recursion at its heart.

Thanks, John.  Yes, we certainly find the whole array of self concepts coming into play here — selfhood, autopoiesis or self creation, self reference and self transformation, just to name a few.  But one thing I need to emphasize from the start is how radically different such concepts appear when viewed in the x‑ray vision of Peirce’s pragmatic semiotics.

I forget where I first heard it, but it’s fairly common observation that the persistence of a recurring problem is a symptom of how unlikely it is to be solved in the paradigm where it keeps occurring.

After a while, it simply becomes time to change the paradigm …

Just by way of a first example, take the very idea of “self‑reference”.  The moment we place it in the medium of triadic sign relations we realize signs do not refer to anything at all except insofar as an interpreter refers them.

And when we ask, “What is this, that we call an interpreter?”, the pragmatic theory of signs tells us we cannot tell when we turn out the light but under the x‑ray of the pragmatic maxim the sum of its effects is effectively modeled by an extended triadic sign relation.

Everything I’ll be working at here will be done within a framework like that.

Regards,
Jon

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

Reflection On Recursion • 4

A feature of special note in the recursion diagram is the function traversing the square from one triadic node to the other.  It preserves an image of the object n all the while its precedent p(n) is being retrieved and processed — thus it injects a measure of parallel process and a modicum of extra memory over and above that afforded by the serial composition of functions.

Simple Recursion

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

Reflection On Recursion • 3

One other feature of syntactic recursion deserves to be brought into higher relief.  Evidence of it can be found in the recursion diagram by examining the places where three paths meet.  On the descending side there is the point where three paths diverge.  On the ascending side there is the point where the middlemost of the three divergent paths joins the upshot arrow in medias res.

Simple Recursion

The arrows of the diagram represent functions, a species of dyadic relations, but nodes of degree three signify aspects of triadic relations somewhere in the mix.

  • The three arrows from the initial node represent a function F : \mathbb{N} \to \mathbb{N} \times \mathbb{N} \times \mathbb{N} such that F(n) = ( p(n), n, f(n) ).
  • The three arrows at the penultimate node represent a function m : \mathbb{N} \times \mathbb{N} \to \mathbb{N} such that m(j, k) = jk.

For the sake of a first approach, many questions about triadic relations which might arise at this point can be safely left to later discussions, since the current level of generality is comprehensible enough in functional terms.

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

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

Reflection On Recursion • 1

Ongoing conversations with Dan Everett on Facebook have me backtracking to recurring questions about the relationship between formal language theory (as I once learned it) and the properties of natural languages as they are found occurring in the field.  A point of particular interest is the role of recursion in formal and natural languages, along with collateral questions about its role in the cognitive sciences at large.

It has taken me quite a while to bring my reflections up to the threshold of minimal coherence — and the inquiry remains ongoing — but it may catalyze the thinking process if I simply share what I’ve thought so far …

Comment 1

Recursion is where you find it — so, myself not being a natural language researcher, when someone who is says they don’t find it in a given corpus I just take them at their word …

Comment 2

The question to which I keep returning has to do with the relationship between two ways we find recursion occurring.

One way I’d call pragmatic recursion — if I wanted to be precise and cover its full scope — since so many of its operations occur without conscious direction, but for now I’ll defer to more familiar language, calling it cognitive or conceptual recursion.

Comment 3

If we discard from the idea of recursion what is not of its essence, we find recursion occurs when our understanding of one situation has recourse to our understanding of other situations.

Very typically, the object situation presents itself as complex, difficult, or unfamiliar while the resource situations are regarded as being better understood.

It must be appreciated, however, that any ranking of situations by level of understanding is contingent on the circumstances in view and may vary radically in alternate settings.

Comment 4

Recursion occurs more markedly in syntactic recursion, where the recursive process shows its character as such in the symbols of its syntactic expression.

A sense of the difference can be gained by looking at a case of ostensible syntactic recursion.  (How much substance backs the ostentation is a subject we’ll take up, maybe at length, but later …)

Consider the following diagram for the computation of a simple recursive function.

Simple Recursion

For example, the factorial function f(n) = n! has a definition in terms of the predecessor function p(n) = n-1 and the multiplier function m(j, k) = j \cdot k.

Comment 5

Recursion is rife in mathematics and computation, typically sporting its recursive character on its sleeve in the fashion of syntax sketched above.  But mathematics and computation are overlearned subjects and practices, enjoying long histories of being gone over with an eye to articulating every last detail of any way they might be conceived and conducted.  So it’s fair to ask whether all that artifice truly tutors nature or only creates a rationalized reconstruction of it.  Then again, even if that’s all it does, is there anything of use to be learned from it?

Comment 6

The prevalence of recursion in mathematics arises from the architecture of mathematical systems.

Mathematical systems grow from a fourfold root.

  • Primitives are taken as initial terms.
  • Definitions expound ever more complex terms in relation to the primitives.
  • Axioms are taken as initial truths.
  • Theorems follow from the axioms by way of inference rules.

Recursive definitions of mathematical objects and inductive proofs of the corresponding theorems follow closely parallel patterns.  And again, in computation, recursive programs follow the same patterns in action.

Resources

cc: Academia.eduCyberneticsLaws of Form • Mathstodon (1) (2) (3)
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

Reflective Interpretive Frameworks • Incident 1

Re: William Waites • The Agent That Doesn’t Know Itself

WW:  ❝Why Has Nobody Done This?❞

People who study C.S. Peirce would say reflective reasoning requires triadic relations at core and there is work being done on that.  One of the challenges is clarifying the role of triadic relations in category theory and raising them into higher relief as fundamental operations.

  • Note.  I was looking for a word to describe a random encounter with something that jogs one’s memory of a recurring theme — incident plays into the reflection theme and looked worth trying for now.

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

Riffs and Rotes • Happy New Year 2026

\text{Let} ~ p_n = \text{the} ~ n^\text{th} ~ \text{prime}.

\begin{array}{llcl}  \text{Then} & 2026 & = & 2 \cdot 1013  \\  && = & p_1 p_{170}  \\  && = & p_1 p_{2 \cdot 5 \cdot 17}  \\  && = & p_1 p_{p_1 p_3 p_7}  \\  && = & p_1 p_{p_1 p_{p_2} p_{p_4}}  \\  && = & p_1 p_{p_1 p_{p_{p_1}} p_{p_{{p_1}^{p_1}}}}  \end{array}

No information is lost by dropping the terminal 1s.  Thus we may write the following form.

2026 = p p_{p p_{p_p} p_{p_{p^p}}}

The article linked below tells how forms of that order correspond to a family of digraphs called riffs and a family of graphs called rotes.  The riff and rote for 2026 are shown in the next two Figures.

Riff 2026

Riff 2026

Rote 2026

Rote 2026

Reference

cc: Academia.eduLaws of FormMathstodonResearch Gate
cc: CyberneticsStructural ModelingSystems ScienceSyscoi

#algebra, #arithmetic, #combinatorics, #computation, #graph-theory, #group-theory, #logic, #mathematics, #number-theory, #recursion, #representation, #riffs-and-rotes, #semiotics, #visualization