#recursion — Public Fediverse posts

.( May the Forth be with you ) CR

#puns #programming #recursion

.( May the Forth be with you ) CR

#puns #programming #recursion

.( May the Forth be with you ) CR

#puns #programming #recursion

Reflection On Recursion • Discussion 1
• https://inquiryintoinquiry.com/2026/04/21/reflection-on-recursion-discussion-1/

Re: Reflection On Recursion • 1
• https://inquiryintoinquiry.com/2026/04/06/reflection-on-recursion-1/
Re: Laws of Form • John Mingers
• https://groups.io/g/lawsofform/message/4943

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.

Et sic deinceps …

#Peirce #Logic #Mathematics
#Recursion #Reflection #Semiotics
#SignRelations #TriadicRelations

Reflection On Recursion • Discussion 1

Re: Reflection On Recursion • 1
Re: Laws of Form • John Mingers

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 under x‑rays 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 think to ask, “What is this that we call an interpreter?”, the pragmatic theory of signs tells us we do not know 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

• Inquiry Driven Systems • Inquiry Into Inquiry
• Reflective Interpretive Frameworks
• The Phenomenology of Reflection
• Higher Order Sign Relations

cc: Academia.edu • Cybernetics • Laws of Form • Mathstodon
cc: Research Gate • Structural Modeling • Systems Science • Syscoi

Reflection On Recursion • 4
• https://inquiryintoinquiry.com/2026/04/18/reflection-on-recursion-4/

A feature worth noting 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
• https://inquiryintoinquiry.com/wp-content/uploads/2026/03/simple-recursion-fn-mn-fpn.png

Resources —

Inquiry Driven Systems • Inquiry Into Inquiry
• https://oeis.org/wiki/Inquiry_Driven_Systems_%E2%80%A2_Overview

Reflective Interpretive Frameworks
• https://oeis.org/wiki/Inquiry_Driven_Systems_%E2%80%A2_Part_10#RIF_1

The Phenomenology of Reflection
• https://oeis.org/wiki/Inquiry_Driven_Systems_%E2%80%A2_Part_11#The_Phenomenology_of_Reflection

Higher Order Sign Relations
• https://oeis.org/wiki/Inquiry_Driven_Systems_%E2%80%A2_Part_12#Higher_Order_Sign_Relations

#Peirce #HigherOrderSignRelations #Inquiry #InquiryIntoInquiry #Logic #Mathematics
#Recursion #Reflection #RelationTheory #Semiotics #SignRelations #TriadicRelations

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 all the while its precedent 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.

Resources

• Inquiry Driven Systems • Inquiry Into Inquiry
• Reflective Interpretive Frameworks
• The Phenomenology of Reflection
• Higher Order Sign Relations

cc: Academia.edu • Cybernetics • Laws of Form • Mathstodon
cc: Research Gate • Structural Modeling • Systems Science • Syscoi

Reflection On Recursion • 3
• https://inquiryintoinquiry.com/2026/04/13/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
• https://inquiryintoinquiry.com/wp-content/uploads/2026/03/simple-recursion-fn-mn-fpn.png

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 : N → N×N×N such that F(n) = (p(n), n, f(n)).

• The three arrows at the penultimate node represent a function m : N×N → 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 —

Inquiry Driven Systems • Inquiry Into Inquiry
• https://oeis.org/wiki/Inquiry_Driven_Systems_%E2%80%A2_Overview

Reflective Interpretive Frameworks
• https://oeis.org/wiki/Inquiry_Driven_Systems_%E2%80%A2_Part_10#RIF_1

The Phenomenology of Reflection
• https://oeis.org/wiki/Inquiry_Driven_Systems_%E2%80%A2_Part_11#The_Phenomenology_of_Reflection

Higher Order Sign Relations
• https://oeis.org/wiki/Inquiry_Driven_Systems_%E2%80%A2_Part_12#Higher_Order_Sign_Relations

#Peirce #HigherOrderSignRelations #Inquiry #InquiryIntoInquiry #Logic #Mathematics
#Recursion #Reflection #RelationTheory #Semiotics #SignRelations #TriadicRelations

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.

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 such that
• The three arrows at the penultimate node represent a function such that

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

• Inquiry Driven Systems • Inquiry Into Inquiry
• Reflective Interpretive Frameworks
• The Phenomenology of Reflection
• Higher Order Sign Relations

cc: Academia.edu • Cybernetics • Laws of Form • Mathstodon
cc: Research Gate • Structural Modeling • Systems Science • Syscoi

Reflection On Recursion • 2
• https://inquiryintoinquiry.com/2026/04/09/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
• https://inquiryintoinquiry.com/wp-content/uploads/2026/03/simple-recursion-fn-mn-fpn.png

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.

cc: https://www.academia.edu/community/L24rvm
cc: https://www.academia.edu/community/LE2mrr
cc: https://www.researchgate.net/post/Reflection_On_Recursion

#Peirce #HigherOrderSignRelations #Inquiry #InquiryIntoInquiry #Logic #Mathematics
#Recursion #Reflection #RelationTheory #Semiotics #SignRelations #TriadicRelations

Reflection On Recursion • 2

Turning to the form of a simple recursive function the clause we used to define it earns the title of “syntactic recursion” due to the way the function name occurring in the defined phrase re‑occurs in the defining phrase

It needs to be clear there is no circle in the definition — each instance of the type 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 predecessor function and the gyre up via the modifier function

Resources

• Inquiry Driven Systems • Inquiry Into Inquiry
• Reflective Interpretive Frameworks
• The Phenomenology of Reflection
• Higher Order Sign Relations

cc: Academia.edu • Cybernetics • Laws of Form • Mathstodon (1) (2) (3)
cc: Research Gate • Structural Modeling • Systems Science • Syscoi

Reflection On Recursion • 1.3
• https://inquiryintoinquiry.com/2026/04/06/reflection-on-recursion-1/

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.

#Peirce #HigherOrderSignRelations #Inquiry #InquiryIntoInquiry #Logic #Mathematics
#Recursion #Reflection #RelationTheory #Semiotics #SignRelations #TriadicRelations

Reflection On Recursion • 1.2
• https://inquiryintoinquiry.com/2026/04/06/reflection-on-recursion-1/

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
• https://inquiryintoinquiry.com/wp-content/uploads/2026/03/simple-recursion-fn-mn-fpn.png

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∙k.

#Peirce #HigherOrderSignRelations #Inquiry #InquiryIntoInquiry #Logic #Mathematics
#Recursion #Reflection #RelationTheory #Semiotics #SignRelations #TriadicRelations

Reflection On Recursion • 1.1
• https://inquiryintoinquiry.com/2026/04/06/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.

Resources —

Inquiry Driven Systems • Inquiry Into Inquiry
• https://oeis.org/wiki/Inquiry_Driven_Systems_%E2%80%A2_Overview

Reflective Interpretive Frameworks
• https://oeis.org/wiki/Inquiry_Driven_Systems_%E2%80%A2_Part_10#RIF_1

The Phenomenology of Reflection
• https://oeis.org/wiki/Inquiry_Driven_Systems_%E2%80%A2_Part_11#The_Phenomenology_of_Reflection

Higher Order Sign Relations
• https://oeis.org/wiki/Inquiry_Driven_Systems_%E2%80%A2_Part_12#Higher_Order_Sign_Relations

#Peirce #HigherOrderSignRelations #Inquiry #InquiryIntoInquiry #Logic #Mathematics
#Recursion #Reflection #RelationTheory #Semiotics #SignRelations #TriadicRelations

TCO in both Python and Rust? What a time to be alive. As a FP advocate, I am in awe.

And if you don't know what TCO is, let me share with you the best conference ever https://www.youtube.com/watch?v=-PX0BV9hGZY&t=1s

Python: https://blog.reverberate.org/2025/02/10/tail-call-updates.html

Rust: https://www.mattkeeter.com/blog/2026-04-05-tailcall/

#python #rust #programming #tco #functionalProgramming #recursion

TCO in both Python and Rust? What a time to be alive. As a FP advocate, I am in awe.

And if you don't know what TCO is, let me share with you the best conference ever https://www.youtube.com/watch?v=-PX0BV9hGZY&t=1s

Python: https://blog.reverberate.org/2025/02/10/tail-call-updates.html

Rust: https://www.mattkeeter.com/blog/2026-04-05-tailcall/

#python #rust #programming #tco #functionalProgramming #recursion

TCO in both Python and Rust? What a time to be alive. As a FP advocate, I am in awe.

And if you don't know what TCO is, let me share with you the best conference ever https://www.youtube.com/watch?v=-PX0BV9hGZY&t=1s

Python: https://blog.reverberate.org/2025/02/10/tail-call-updates.html

Rust: https://www.mattkeeter.com/blog/2026-04-05-tailcall/

#python #rust #programming #tco #functionalProgramming #recursion

TCO in both Python and Rust? What a time to be alive. As a FP advocate, I am in awe.

And if you don't know what TCO is, let me share with you the best conference ever https://www.youtube.com/watch?v=-PX0BV9hGZY&t=1s

Python: https://blog.reverberate.org/2025/02/10/tail-call-updates.html

Rust: https://www.mattkeeter.com/blog/2026-04-05-tailcall/

#python #rust #programming #tco #functionalProgramming #recursion

TCO in both Python and Rust? What a time to be alive. As a FP advocate, I am in awe.

And if you don't know what TCO is, let me share with you the best conference ever https://www.youtube.com/watch?v=-PX0BV9hGZY&t=1s

Python: https://blog.reverberate.org/2025/02/10/tail-call-updates.html

Rust: https://www.mattkeeter.com/blog/2026-04-05-tailcall/

#python #rust #programming #tco #functionalProgramming #recursion

He liberado mi libro «Desafíos de programación atemporales y multiparadigmáticos» para leer online de forma gratuita:

https://andros.dev/libro/desafios-de-programacion-atemporales-y-multiparadigmaticos/

Podéis apoyarme comprando la versión en tapa blanda: https://www.amazon.es/dp/B0FK3PK2TM

#programacion #programming #algoritmos #algorithms #python #programacionfuncional #functionalprogramming #librosgratis #freebooks #aprendeprogramacion #learntocode #opensource #recursion #datastructures

Reflective Interpretive Frameworks • Incident 1
• https://inquiryintoinquiry.com/2026/03/26/reflective-interpretive-frameworks-incident-1/

Re: William Waites • The Agent That Doesn't Know Itself
• https://johncarlosbaez.wordpress.com/2026/03/20/the-agent-that-doesnt-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 —

Inquiry Driven Systems • Inquiry Into Inquiry
• https://oeis.org/wiki/Inquiry_Driven_Systems_%E2%80%A2_Overview

Reflective Interpretive Frameworks
• https://oeis.org/wiki/Inquiry_Driven_Systems_%E2%80%A2_Part_10#Reflective_Interpretive_Frameworks

The Phenomenology of Reflection
• https://oeis.org/wiki/Inquiry_Driven_Systems_%E2%80%A2_Part_11#The_Phenomenology_of_Reflection

Higher Order Sign Relations
• https://oeis.org/wiki/Inquiry_Driven_Systems_%E2%80%A2_Part_12#Higher_Order_Sign_Relations

Notes On Categories
• https://inquiryintoinquiry.com/2013/02/22/notes-on-categories-1/
• https://inquiryintoinquiry.com/2021/07/31/notes-on-categories-2/

#Peirce #HigherOrderSignRelations #Inquiry #InquiryIntoInquiry #Logic #Mathematics
#Recursion #Reflection #RelationTheory #Semiotics #SignRelations #TriadicRelations

🎩🤡 Oh joy, another "brilliant" attempt to bootstrap a bootstrap with a #compiler to compile a compiler! Because, clearly, what the world needs now is a never-ending #recursion saga. Throw in some #GitHub #buzzwords and voila—innovation! 🙄✨
https://github.com/FransFaase/MES-replacement #bootstrapping #innovation #HackerNews #ngated

👨‍💻 Ah, behold the latest triumph in the annals of "because we can" programming: Zinc! A systems language so cutting-edge it managed to rediscover the joys of #recursion... and parsing! ⚙️✨ Meanwhile, not-so-secretly, developers everywhere are still trying to figure out why they need another #programming language when we already have 256 too many. 🤔🔍
https://sr.ht/~oconnor0/zinc/ #Zinc #systemslanguage #codingtriumph #HackerNews #HackerNews #ngated

Many people say that #Rust is very hard to #prototype with or to #refactor. This couldn't be further from the truth! It is the exact opposite!

Let me share with you one of the most profound experiences I had with #RustLang on a casual sunday - a thread 🧵

I'm currently rewriting my #transpiler from #nom to #chumsky and until now everything has turned out great so far, until I've hit the following road block:
Implementing parsers by using #parser functions that have indirect #recursion.

1/11

Left Recursion in Parsing Expression Grammars:

https://arxiv.org/pdf/1207.0443v1.pdf

"A frequently missed feature of PEGs is left #recursion, which is commonly used in Context-Free Grammars (#CFGs) to encode left-associative operations. We present a simple conservative extension to the semantics of #PEGs that gives useful meaning to direct and indirect left-recursive rules, and show that our extensions make it easy to express left-recursive idioms from CFGs in PEGs, with similar results."

#Parser #PEG

High Resolution Render for Patrons of Level Square and up - Final Version!

Nested Apollonial Gaskets, 3 steps of Recursion Deep! 25600×25600 pixels, circles rendered down do curvatures of 5120.

#circlepacking #recursion