Skip to content

Generative Systems Theory

Sep 2026 · Zenodo (CERN European Organization for Nuclear Research)

Abstract

Generative Systems Theory is a foundational inquiry and metaphysics concerning systems theory and complexity science. It focuses on how concepts regarded as basic elements—such as nodes, relations, compatibility, attractors, information, and so on—come into being in the first place, and on what grounds they can be said to exist. If we do not simply assume that they already exist, can they instead be derived from fewer premises and more parsimonious conditions? It is also committed to integrating different, scattered domains into a single generative genealogy: how influence generates constraints; how constraints generate interactions and coupling; how uneven influence generates differences in state; how states and constraints generate evolutionary trajectories; how evolutionary trajectories generate compatibility and attractors; how compatibility and attractors serve as preconditions for nodes and systems; how nodes are represented; what hidden coupling conditions lie behind representation; how synchronicity should be explained; what distinguishes a system from a node; whether relations can be divided into fundamentally different types at the most basic level; why some systems possess robustness; into how many types robustness can be further classified; how a form of information that does not depend on bits can be derived and defined purely from systemic logic; how cognitive systems maximize information; what the most fundamental difference is between living systems and other systems; why gene-centered theories in biology are difficult to sustain; what two opposite extremes animals and artificial intelligence occupy, and why humans lie in the intermediate zone; what the core cognitive functions of human beings are besides embodiment; how the most distinctive and difficult-to-articulate human cognitive functions can be connected with neural networks; what common information-theoretic foundation underlies theories such as Archetype, predictive processing, and generative grammar; how that information-theoretic foundation can be used to derive the optimal forms of human–computer interaction and human–machine symbiosis; how modern Pythagoreanism relates to academic institutions and historical change; and, rather than dividing explanations into top-down and bottom-up, what kind of general explanation can come closer to the underlying logic of predictive processing, and so on and so forth. All of these are derived from the foundational theory of Generative Systems Theory. The theoretical extensions beyond the core framework are as follows: Reinterpret “prediction” from a specific cognitive function into a universal mechanism of state-space convergence. Derive the cognitive system’s “sample space” from state-space theory, and use it to provide a unified explanation of memory, prediction, perception, intuition, and archetypes. Derive self-reference paradoxes from node robustness, and transform the problem of self-reference from a logical problem into a problem of generative conditions. Further derive a theory of judgment concerning subjectivity, objectivity, and authenticity from the problem of self-reference. Place logic, reason, and the a priori within an evolutionary genealogy, and propose the concept of “relative first-order status.” Distinguish output diversity from semantic freedom, and propose “cognitive friction” as a metric for evaluating the compatibility of human–AI coupling. Reinterpret the broad problem of AI overfitting through the concept of “natural attractors.” Propose “constraint isomorphism,” freeing understanding from content similarity and representational replication. Reinterpret “structure” from traditional positive-space morphology as negative-space constraints within state space.

View source

Similar papers

#artificial intelligence Open access May 2023

Evaluating the Performance of Large Language Models on GAOKAO Benchmark

GAOKAO-Bench is introduced, an intuitive benchmark that employs questions from the Chinese GAOKAO examination as test samples, including both subjective and objective questions that contribute a robust evaluation benchmark for future large language models and offers valuable insights into the advantages and limitations of such models.

Xiaotian Zhang, Chun-yan Li, Yi Zong et al. · 216 citations · ⚡17
#artificial intelligence Open access Jul 2024

Gender, Race, and Intersectional Bias in Resume Screening via Language Model Retrieval

This work investigates the possibilities of using LLMs in a resume screening setting via a document retrieval framework that simulates job candidate selection and finds that the MTEs are biased, significantly favoring White-associated names in 85% of cases and female-associated names in only 11.1% of cases.

Kyra Wilson, Aylin Caliskan · 131 citations · ⚡8

PRISM: Self-Pruning Intrinsic Selection Method for Training-Free Multimodal Data Selection

Empirically, PRISM reduces the end-to-end time for data selection and model tuning to just 30% of conventional pipelines, and achieves this efficiency while simultaneously enhancing performance, surpassing models fine-tuned on the full dataset across eight multimodal and three language understanding benchmarks.

Jinhe Bi, Yifan Wang, Danqi Yan et al. · 73 citations · ⚡4
#artificial intelligence Conference Open access Apr 2020

ECCOLA - a Method for Implementing Ethically Aligned AI Systems

The method, ECCOLA, is presented, which aims at making the high-level AI ethics principles more practical, making it possible for developers to more easily implement them in practice.

Ville Vakkuri, Kai-Kristian Kemell, P. Abrahamsson · 64 citations · ⚡6
#computer vision Review Apr 2024

AI-powered Code Review with LLMs: Early Results

The goal is to not only refine the accuracy of the LLM-based tool but also to underscore its potential in streamlining the software development lifecycle through proactive code improvement and education.

Z. Rasheed, Malik Abdul Sami, Muhammad Waseem et al. · 62 citations · ⚡3

Let the Flows Tell: Solving Graph Combinatorial Optimization Problems with GFlowNets

This paper designs Markov decision processes (MDPs) for different combinatorial problems and proposes to train conditional GFlowNets to sample from the solution space and demonstrates that GFlowNet policies can efficiently find high-quality solutions.

Dinghuai Zhang, H. Dai, Esmeralda S. Whitammer et al. · 59 citations · ⚡8

Related blog posts

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.