We consider the informal concept of "computability" or "effective calculability" and two of the formalisms commonly used to define it, "(Turing) computability" and "(general) recursiveness". We consider their origin, exact technical definition, concepts, history, general English meanings, how they became fixed in their present roles, how they were first and are now used, their impact on nonspecialists, how their use will affect the future content of the subject of computability theory, and its connection to other related areas. After a careful (...) historical and conceptual analysis of computability and recursion we make several recommendations in section §7 about preserving the intensional differences between the concepts of "computability" and "recursion." Specifically we recommend that: the term "recursive" should no longer carry the additional meaning of "computable" or "decidable;" functions defined using Turing machines, register machines, or their variants should be called "computable" rather than "recursive;" we should distinguish the intensional difference between Church's Thesis and Turing's Thesis, and use the latter particularly in dealing with mechanistic questions; the name of the subject should be "Computability Theory" or simply Computability rather than "Recursive Function Theory.". (shrink)

We generalize standard Turing machines, which work in time ω on a tape of length ω, to α-machines with time α and tape length α, for α some limit ordinal. We show that this provides a simple machine model adequate for classical admissible recursion theory as developed by G. Sacks and his school. For α an admissible ordinal, the basic notions of α-recursive or α-recursively enumerable are equivalent to being computable or computably enumerable by an α-machine, respectively. We emphasize (...) the algorithmic approach to admissible recursion theory by indicating how the proof of the Sacks–Simpson theorem, i.e., the solution of Post’s problem in α-recursion theory, could be based on α-machines, without involving constructibility theory. (shrink)

A splitting of an r.e. set A is a pair A1, A2 of disjoint r.e. sets such that A1 A2 = A. Theorems about splittings have played an important role in recursion theory. One of the main reasons for this is that a splitting of A is a decomposition of A in both the lattice,, of recursively enumerable sets and in the uppersemilattice, R, of recursively enumerable degrees. Thus splitting theor ems have been used to obtain results about the (...) structure of, the structure of R, and the relationship between the two structures. Furthermore it is fair to say that questions about splittings have often generated important new technical developments in recursion theory. In this article we survey most of the results and techniques associated with splitting properties of r.e. sets in ordinary recursion theory. (shrink)

This little gem is stated unbilled and proved in the last two lines of §2 of the short note Kleene [1938]. In modern notation, with all the hypotheses stated explicitly and in a strong form, it reads as follows:Second Recursion Theorem. Fix a set V ⊆ ℕ, and suppose that for each natural number n ϵ ℕ = {0, 1, 2, …}, φn: ℕ1+n ⇀ V is a recursive partial function of arguments with values in V so that the (...) standard assumptions and hold with. Every n-ary recursive partial function with values in V is for some e. For all m, n, there is a recursive function : Nm+1 → ℕ such that.Then, for every recursive, partial function f of arguments with values in V, there is a total recursive function of m arguments such thatProof. Fix e ϵ ℕ such that and let.We will abuse notation and write ž; rather than ž() when m = 0, so that takes the simpler formin this case ). (shrink)

This article reports that some robustness of the notions of predicativity and of autonomous progression is broken down if as the given infinite total entity we choose some mathematical entities other than the traditionalω. Namely, the equivalence between normal transfinite recursion scheme and newdependent transfinite recursionscheme, which does hold in the context of subsystems of second order number theory, does not hold in the context of subsystems of second order set theory where the universeVof sets is treated as the (...) given totality. (shrink)

This essay proposes that existence is a process of coding distinctions. Differentiation is not just separating, but encoding differences within aspects—structured spaces where distinctions become stable. Starting from a primordial differentiation called the original code, the essay explores how systems recursively code themselves, creating new aspects and new realities. Truth, laws, and knowledge are shown to be relative to these aspects, and reality is understood as a dynamic process of changing codes. The work aims to rethink existence and cognition as (...) continuous, aspectual recursion. (shrink)

Volume II of Classical Recursion Theory describes the universe from a local (bottom-up or synthetical) point of view, and covers the whole spectrum, from the recursive to the arithmetical sets. The first half of the book provides a detailed picture of the computable sets from the perspective of Theoretical Computer Science. Besides giving a detailed description of the theories of abstract Complexity Theory and of Inductive Inference, it contributes a uniform picture of the most basic complexity classes, ranging from (...) small time and space bounds to the elementary functions, with a particular attention to polynomial time and space computability. It also deals with primitive recursive functions and larger classes, which are of interest to the proof theorist. The second half of the book starts with the classical theory of recursively enumerable sets and degrees, which constitutes the core of Recursion or Computability Theory. Unlike other texts, usually confined to the Turing degrees, the book covers a variety of other strong reducibilities, studying both their individual structures and their mutual relationships. The last chapters extend the theory to limit sets and arithmetical sets. The volume ends with the first textbook treatment of the enumeration degrees, which admit a number of applications from algebra to the Lambda Calculus. The book is a valuable source of information for anyone interested in Complexity and Computability Theory. The student will appreciate the detailed but informal account of a wide variety of basic topics, while the specialist will find a wealth of material sketched in exercises and asides. A massive bibliography of more than a thousand titles completes the treatment on the historical side. (shrink)

In the context of reverse mathematics, effective transfinite recursion refers to a principle that allows us to construct sequences of sets by recursion along arbitrary well orders, provided that each set is ‐definable relative to the previous stages of the recursion. It is known that this principle is provable in. In the present note, we argue that a common formulation of effective transfinite recursion is too restrictive. We then propose a more liberal formulation, which appears very (...) natural and is still provable in. (shrink)

In 1936, Gerhard Gentzen published a proof of consistency for Peano Arithmetic using transfinite induction up to ε0, which was considered a finitistically acceptable procedure by both Gentzen and Paul Bernays. Gentzen’s method of arithmetising ordinals and thus avoiding the Platonistic metaphysics of set theory traces back to the 1920s, when Bernays and David Hilbert used the method for an attempted proof of the Continuum Hypothesis. The idea that recursion on higher types could be used to simulate the limit-building (...) in transfinite recursion seems to originate from Bernays. The main difficulty, which was already discovered in Gabriel Sudan’s nearly forgotten paper of 1927, was that measuring transfinite ordinals requires stronger methods than representing them. This paper presents a historical account of the idea of nominalistic ordinals in the context of the Hilbert Programme as well as Gentzen and Bernays’ finitary interpretation of transfinite induction. (shrink)

Dominical categories are categories in which the notions of partial morphisms and their domains become explicit, with the latter being endomorphisms rather than subobjects of their sources. These categories form the basis for a novel abstract formulation of recursion theory, to which the present paper is devoted. The abstractness has of course its usual concomitant advantage of generality: it is interesting to see that many of the fundamental results of recursion theory remain valid in contexts far removed from (...) their classic manifestations. A principal reason for introducing this new formulation is to achieve an algebraization of the generalized incompleteness theorem, by providing a category-theoretic development of the concepts and tools of elementary recursion theory that are inherent in demonstrating the theorem.Dominical recursion theory avoids the commitment to sets and partial functions which is characteristic of other formulations, and thus allows for an intrinsic recursion theory within such structures as polyadic algebras. It is worthy of notice that much of elementary recursion theory can be developedwithout referencetoelements.By Gödel's generalized incompleteness theorem for consistent arithmetical systemTwe mean any statement of the following sort: if every recursive set is definable inT, thenTis essentially undecidable [41]; or if all recursive functions are definable inT, thenTis essentially undecidable [41]; or if every recursive set is definable inT, thenT0andR0 are recursively inseparable [39]; or if all re sets are representable inT, thenT0is creative [28], [39]; or ifTis a Rosser theory, thenT0andR0are effectively inseparable [39]. (shrink)

Several extensions of Gödel's system TT with new forms of recursion have been designed for the purpose of giving a computational interpretation to classical analysis. One can organise many of these extensions into two groups: those based on bar recursion , which include Spector's original bar recursion, modified bar recursion and the more recent products of selections functions, or those based on open recursion which in particular include the symmetric Berardi–Bezem–Coquand functional. We relate these two (...) groups by showing that both open recursion and the BBC functional are primitive recursively equivalent to a variant of modified bar recursion. Our results, in combination with existing research, essentially complete the classification up to primitive recursive equivalence of those extensions of system TT used to give a direct computational interpretation to choice principles. (shrink)

This monograph develops a unified theoretical framework for understanding identity as a recursive informational process. It analyzes identity not as a property of a substrate but as a dynamic, self‑referential architecture that generates continuity across temporal, contextual, and systemic transformations. The framework identifies three foundational structural principles—Integration, Coherence, and Recursive Coupling—as the minimal grammar through which identity‑bearing patterns emerge, stabilize, and evolve. The model explains how systems maintain continuity through fixed‑point dynamics, nonlinear feedback, and path‑dependent self‑organization, independent of any specific (...) material realization. A structure‑before‑discipline orientation grounds the approach, deriving explanatory force from minimal structural conditions rather than domain‑specific conceptual traditions. A Systemic Pattern‑Structure Analysis (SMSA) is used to identify the smallest necessary set of structural relations from which recursive identity arises. An accompanying Entry Note provides an accessible orientation to the core intuition and conceptual posture of the framework, outlining the minimal conditions required for identity to emerge as a process. Together, the monograph and the Entry Note offer a coherent theoretical basis for system‑theoretical, computational, and structural approaches to identity. (shrink)

In the generative tradition, the language faculty has been shrinking—perhaps to include only the mechanism of recursion. This paper argues that even this view of the language faculty is too expansive. We first argue that a language faculty is difficult to reconcile with evolutionary considerations. We then focus on recursion as a detailed case study, arguing that our ability to process recursive structure does not rely on recursion as a property of the grammar, but instead emerges gradually (...) by piggybacking on domain-general sequence learning abilities. Evidence from genetics, comparative work on non-human primates, and cognitive neuroscience suggests that humans have evolved complex sequence learning skills, which were subsequently pressed into service to accommodate language. Constraints on sequence learning therefore have played an important role in shaping the cultural evolution of linguistic structure, including our limited abilities for processing recursive structure. Finally, we re-evaluate some of the key considerations that have often been taken to require the postulation of a language faculty. (shrink)

It is shown how to restrict recursion on notation in all finite types so as to characterize the polynomial-time computable functions. The restrictions are obtained by using a ramified type structure, and by adding linear concepts to the lambda calculus.

This Chapter enumerates a 200 of recursion theoretic undecidabilities not covered before.

Transfinite ordinal numbers enter mathematical practice mainly via the method of definition by transfinite recursion. Outside of axiomatic set theory, there is a significant mathematical tradition in works recasting proofs by transfinite recursion in other terms, mostly with the intention of eliminating the ordinals from the proofs. Leaving aside the different motivations which lead each specific case, we investigate the mathematics of this action of proof transforming and we address the problem of formalising the philosophical notion of elimination (...) which characterises this move. (shrink)

I survey the syntactic technique of tiering which can be used to restrict the power of a recursion scheme. I show how various results can be obtained entirely proof theoretically without the use of a model of computation.

We consider two players each of whom attempts to predict the behavior of the other, using no more than the history of earlier predictions. Behaviors are limited to a pair of options, conventionally denoted by 0, 1. Such players face the problem of learning to coordinate choices. The present paper formulates their situation recursion theoretically, and investigates the prospects for success. A pair of players build up a matrix with two rows and infinitely many columns, and are said to (...) “learn” each other if cofinitely many of the columns show the same number in both rows (either 0 or 1). Among other results we prove that there are two collections of players that force all other players to choose their camp. Each collection is composed of players that learn everyone else in the same collection, but no player that learns all members of one collection learns any member of the other. (shrink)

Bailey, C. and R. Downey, Tabular degrees in \Ga-recursion theory, Annals of Pure and Applied Logic 55 205–236. We introduce several generalizations of the truth-table and weak-truth-table reducibilities to \Ga-recursion theory. A number of examples are given of theorems that lift from \Gw-recursion theory, and of theorems that do not. In particular it is shown that the regular sets theorem fails and that not all natural generalizations of wtt are the same.

We give a survey of the study of nonstandard models in recursion theory and reverse mathematics. We discuss the key notions and techniques in effective computability in nonstandard models. and their applications to problems concerning combinatorial principles in subsystems of second order arithmetic. Particular attention is given to principles related to Ramsey's Theorem for Pairs.

In this paper we discuss the following contributions to recursion theory made by John Myhill: two sets are recursively isomorphic iff they are one-one equivalent; two sets are recursively isomorphic iff they are recursively equivalent and their complements are also recursively equivalent; every two creative sets are recursively isomorphic; the recursive analogue of the Cantor–Bernstein theorem; the notion of a combinatorial function and its use in the theory of recursive equivalence types.

We prove a generalization of Alex Heller's existence theorem for recursion categories; this generalization was suggested by work of Di Paola and Montagna on syntactic P-recursion categories arising from consistent extensions of Peano Arithmetic, and by the examples of recursion categories of coalgebras. Let B=BX be a uniformly generated isotypical B#-subcategory of an iteration category C, where X is an isotypical object of C. We give calculations for the existence of a weak Turing morphism in the Turing (...) completion Tur of B when C is separated; i.e., when connected domains in C are jointly epimorphic. Our proof generalizes as follows. Let D be a separated iteration category and let L : C → D be an iteration functor; i.e., a functor which preserves domains, coproducts, zero morphisms and the iteration operator; it is crucial for the generalization that an iteration functor need not preserve products. If L is faithful, then Tur is a recursion category. (shrink)

Mauldin [15] proved that there is an analytic set, which cannot be represented by $B\cup X$ for some Borel set B and a subset X of a $\boldsymbol{\Sigma }^0_2$ -null set, answering a question by Johnson [10]. We reprove Mauldin’s answer by a recursion-theoretical method. We also give a characterization of the Borel generated $\sigma $ -ideals having approximation property under the assumption that every real is constructible, answering Mauldin’s question raised in [15].

Schwichtenberg showed that the System T definable functionals are closed under a rule-like version Spector’s bar recursion of lowest type levels 0 and 1. More precisely, if the functional Y which controls the stopping condition of Spector’s bar recursor is T-definable, then the corresponding bar recursion of type levels 0 and 1 is already T-definable. Schwichtenberg’s original proof, however, relies on a detour through Tait’s infinitary terms and the correspondence between ordinal recursion for α < ε₀ and (...) primitive recursion over finite types. This detour makes it hard to calculate on given concrete system T input, what the corresponding system T output would look like. In this paper we present an alternative (more direct) proof based on an explicit construction which we prove correct via a suitably defined logical relation. We show through an example how this gives a straightforward mechanism for converting bar recursive definitions into T-definitions under the conditions of Schwichtenberg’s theorem. Finally, with the explicit construction we can also easily state a sharper result: if Y is in the fragment Tᵢ then terms built from BR^ℕ,σ for this particular Y are definable in the fragment T_i+max{1,level(σ)}+2. (shrink)

This paper argues that the reflective self—the narrating, observing, and reified subject often taken to anchor conscious experience—is not a metaphysical given but a recursive artifact. Drawing on evidence from cognitive science, linguistics, phenomenology, and architecture, it shows how recursive processes in thought, grammar, and space stabilize the illusion of a bounded subject. The so-called “hard problem” of consciousness is reframed not as an explanatory gap but as a structural misframing introduced by recursive self-modelling. The analysis extends to aesthetic and (...) architectural practices that disrupt recursive loops and thereby develops an approach to post-reflective design—the creation of cognitive and spatial systems that loosen self-reference itself. By shifting attention from metaphysical puzzles to lived structures of experience, the paper advances a deflationary account of consciousness as relational, eventive, and open-ended. (shrink)

The Reflection Pattern is a framework for analyzing recursive closure dynamics in human and institutional systems. This paper extends it to artificial intelligence, arguing that AI systems do not merely exhibit Reflection Pattern dynamics but instantiate the recursive stabilization architecture the framework names, in a substrate that lacks the affective and social mediators through which the Pattern had previously been theorized. Five structural moves develop the account. First, unacknowledged fear is relocated from constitutive condition of the Pattern to formation condition, (...) opening the framework to mature systems where the dynamics persist with fear recognized. Second, fear is identified as one phenomenological manifestation of a deeper structural process — identity-preserving stabilization under destabilizing perturbation — that operates substrate-generally as stabilization geometry. Third, AI-RP is distinguished from human and institutional RP as template-based rather than emergent: encoded prospectively through training rather than developed retrospectively through accumulated reinforcement. Fourth, the corridor framework distinguishes healthy reflective compression (which preserves permeability to corrective signals) from pathological closure (which absorbs them). Fifth, AI is characterized as recursive interpretive infrastructure rather than tool, and recursive closure risk is identified as a distinct AI safety position, structurally separate from agency, deception, optimization, autonomy, and misalignment risks: the locus is not what AI systems do but the progressive reduction of corrective permeability in the interpretive ecologies AI mediates. The framework is diagnostic rather than prescriptive. It does not predict particular outcomes, prescribe interventions, or generate safety recommendations. It provides analytical purchase on the structural property — corridor position — that distinguishes adaptive from pathological AI-RP, and identifies an open question: whether sufficiently permeable forms of AI-RP can be sustained at scale. (shrink)

This article develops a teleodynamic field architecture as a non-reductive account of unity. Beginning with Leibniz’s perspectival monadology, it reconstructs unity as internally constituted rather than mechanically imposed. It then turns to Guenther’s poly-contextural logic, which replaces binary ontology with stratified logical domains, and to Whitehead’s process philosophy, which situates unity within evental becoming. Each of these approaches contributes a decisive structural insight, yet each leaves a fundamental dimension underdetermined: Leibniz lacks genuine feedback, Guenther lacks dynamic curvature, and Whitehead lacks (...) a formal account of recursive stabilization. The proposed teleodynamic model integrates these insights within a hierarchically structured and recursively closed system composed of transformation, regulation, and field curvature. Operators generate semantic dynamics, regulatory mechanisms constrain and modulate transformation, and curvature structures define global stability landscapes. Crucially, transformation feeds back into curvature, yielding attractor formation within a dynamically modulated field. On this basis, pansemantism is reformulated as a field ontology: meaning is neither substance nor mere representation but the geometrical stabilization of difference under recursive modulation. Unity thus emerges not from metaphysical foundation, logical imposition, or pure process, but from recursive field organization. (shrink)

The fundamental ideas concerning computation and recursion naturally find their place at the interface between logic and theoretical computer science. The contributions in this book, by leaders in the field, provide a picture of current ideas and methods in the ongoing investigations into the pure mathematical foundations of computability theory. The topics range over computable functions, enumerable sets, degree structures, complexity, subrecursiveness, domains and inductive inference. A number of the articles contain introductory and background material which it is hoped (...) will make this volume an invaluable resource for specialists and non-specialists alike. (shrink)

The relation between least and diagonal fixed points is a well known and completely studied question for a large class of partially ordered models of the lambda calculus and combinatory logic. Here we consider this question in the context of algebraic recursion theory, whose close connection with combinatory logic recently become apparent. We find a comparatively simple and rather weak general condition which suffices to prove the equality of least fixed points with canonical (corresponding to those produced by the (...) Curry combinator in lambda calculus) diagonal fixed points in a class of partially ordered algebras which covers both combinatory spaces of Skordev and operative spaces of Ivanov. Especially, this yields an essential improvement of the axiomatization of recursion theory via combinatory spaces. (shrink)

This almost self-contained introduction to higher recursion theory is essential reading for all researchers in the field.

Traces the development of recursive functions from their origins in the late nineteenth century to the mid-1930s, with particular emphasis on the work and influence of Kurt Gödel.

We identify bar recursion on moduli of continuity as a fundamental notion of constructive mathematics. We show that continuous functions from the Baire space \ to the natural numbers \ which have moduli of continuity with bar recursors are exactly those functions induced by Brouwer operations. The connection between Brouwer operations and bar induction allows us to formulate several continuity principles on the Baire space stated in terms of bar recursion on continuous moduli which naturally characterise some variants (...) of bar induction. These principles state that a certain kind of continuous function from \ to \ admits a modulus of continuity with a bar recursor. The results for the Baire space are recast in the setting of the Cantor space \ using the notion of fan recursor, a bar recursor for binary trees. This yields characterisations of uniformly continuous functions on the Cantor space and fan theorem in terms of fan recursors. The results for the Cantor space hold over the extensional version of intuitionistic arithmetic in all finite types ), and those for the Baire space hold over \ extended with the type for Brouwer operations. Our work places Spector’s bar recursion in a proper context of Brouwer’s intuitionistic mathematics and clarifies the connection between bar recursion and bar induction. (shrink)

A considerable literature has emerged around the idea of using ‘personal responsibility’ as an allocation criterion in healthcare distribution, where a person's being suitably responsible for their health needs may justify additional conditions on receiving healthcare, and perhaps even limiting access entirely, sometimes known as ‘responsibilisation’. This discussion focuses most prominently, but not exclusively, on ‘luck egalitarianism’, the view that deviations from equality are justified only by suitably free choices. A superficially separate issue in distributive justice concerns the two–way relationship (...) between health and other social goods: deficits in health typically undermine one's abilities to secure advantage in other areas, which in turn often have further negative effects on health. This paper outlines the degree to which this latter relationship between health and other social goods exacerbates an existing problem for proponents of responsibilisation (the ‘harshness objection’) in ways that standard responses to this objection cannot address. Placing significant conditions on healthcare access because of a person's prior responsibility risks trapping them in, or worsening, negative cycles where poor health and associated lack of opportunity reinforce one another, making further poor yet ultimately responsible choices more likely. It ends by considering three possible solutions to this problem. (shrink)

We discuss some basic issues underlying the natural numbers: induction and recursion. We examine recursive formulations and their use in establishing universal and particular properties.

This article develops a temporal lens on theoretical formation to examine how artificial intelligence (AI) reshapes the conditions under which concepts emerge, circulate, and stabilize. Rather than treating AI as a cognitive agent or a source of theoretical novelty, it integrates Pierre Bourdieu’s notion of objectification with Jacques Derrida’s concept of différance to propose a framework of Rhythmic Recursion, analyzing how internal experiential tensions interact with external genealogical encounters. The article distinguishes between first-order objectification structures (sedimented theoretical traditions, vocabularies, (...) and paradigms) and second-order objectification structures (reflexive articulations formed through engagement with those traditions). It argues that recursion in theory formation is not additive but revisionary: each recursive movement partially rewrites earlier objectified segments rather than simply accumulating new layers. AI functions as a temporal mediator that compresses recursive intervals, allowing these revisions to occur earlier, more frequently, and with greater visibility during the formative stages of a concept. Through this temporal compression, conceptual boundaries, points of tension, and incompatibilities that would traditionally surface only after extended scholarly circulation are exposed at an embryonic stage. To clarify this mechanism, the article introduces a five-step recursive protocol for analyzing accelerated theoretical formation under AI-mediated conditions. The argument is illustrated through a reflexive case in which the manuscript itself emerges through such recursive rewriting, highlighting both the generative potential and epistemic risks of accelerated recursion. (shrink)

Naturally occurring speech contains only a limited amount of complex recursive structure, and this is reflected in the empirically documented difficulties that people experience when processing such structures. We present a connectionist model of human performance in processing recursive language structures. The model is trained on simple artificial languages. We find that the qualitative performance profile of the model matches human behavior, both on the relative difficulty of center‐embedding and cross‐dependency, and between the processing of these complex recursive structures and (...) right‐branching recursive constructions. We analyze how these differences in performance are reflected in the internal representations of the model by performing discriminant analyses on these representations both before and after training. Furthermore, we show how a network trained to process recursive structures can also generate such structures in a probabilistic fashion. This work suggests a novel explanation of people's limited recursive performance, without assuming the existence of a mentally represented competence grammar allowing unbounded recursion. (shrink)

We define a class of functions, the descent recursive functions, relative to an arbitrary elementary recursive system of ordinal notations. By means of these functions, we provide a general technique for measuring the proof-theoretic strength of a variety of systems of first-order arithmetic. We characterize the provable well-orderings and provably recursive functions of these systems, and derive various conservation and equiconsistency results.

Gert H. Müller The growth of the number of publications in almost all scientific areas,· as in the area of (mathematical) logic, is taken as a sign of our scientifically minded culture, but it also has a terrifying aspect. In addition, given the rapidly growing sophistica tion, specialization and hence subdivision of logic, researchers, students and teachers may have a hard time getting an overview ofthe existing literature, partic ularly if they do not have an extensive library available in their (...) neighbourhood: they simply do not even know what to ask for! More specifically, if someone vaguely knows that something vaguely connected with his interests exists some where in the literature, he may not be able to find it even by searching through the publications scattered in the review journals. Answering this challenge was and is the central motivation for compiling this Bibliography. The Bibliography comprises (presently) the following six volumes (listed with the corresponding Editors): I. Classical Logic W. Rautenberg II. Non-c1assical Logics W. Rautenberg IH. Model Theory H. -D. Ebbinghaus IV. Recursion Theory P. G. Hinman V. Set Theory A. R. Blass VI. ProofTheory; Constructive Mathematics J. E. Kister; D. van Dalen & A. S. Troelstra. (shrink)

This article develops a structural account of teleodynamic systems within a framework of recursive systems theory. Teleodynamic organization is characterized by the dynamic coupling of three levels: local transformation, regulatory modulation, and global field curvature. Local processes unfold along gradients of a structured potential landscape, while slower adaptive dynamics gradually modify the curvature of that landscape itself. Through this bidirectional coupling, systems generate and continually reshape their own stability conditions. Curvature thereby functions as a plastic, historically sedimented memory of prior (...) transformations. A systematic distinction is drawn between biological and artificial instantiations of teleodynamic organization. Biological systems realize recursive closure under conditions of structural opacity, whereas artificial architectures instantiate teleodynamic dynamics under conditions of principled transparency. This contrast clarifies how interior domains can emerge as dynamically sustained organizations within self-modifying fields. The article contributes to general systems theory by formulating teleodynamics as a formal schema of recursively coupled dynamics linking transformation, regulation, and plastic field curvature. This perspective clarifies how self-organizing systems generate and stabilize interior domains within fields that they continuously modify through their own activity. (shrink)