Experimental simulation of emergent complexity through graph-rewriting automata.
Rabrg/artificial-life
A simple (300 lines of code) reproduction of Computational Life: How Well-formed, Self-replicating Programs Emerge from Simple Interaction
Software in the natural world: A computational approach to hierarchical emergence
Understanding the functional architecture of complex systems is crucial to illuminate their inner workings and enable effective methods for their prediction and control. Recent advances have introduced tools to characterise emergent macroscopic levels; however, while these approaches are successful in identifying when emergence takes place, they are limited in the extent they can determine how it does. Here we address this limitation by developing a computational approach to emergence, which characterises macroscopic processes in terms of their computational capabilities. Concretely, we articulate a view on emergence based on how software works, which is rooted on a mathematical formalism that articulates how macroscopic processes can express self-contained informational, interventional, and computational properties. This framework establishes a hierarchy of nested self-contained processes that determines what computations take place at what level, which in turn delineates the functional architecture of a complex system. This approach is illustrated on paradigmatic models from the statistical physics and computational neuroscience literature, which are shown to exhibit macroscopic processes that are akin to software in human-engineered systems. Overall, this framework enables a deeper understanding of the multi-level structure of complex systems, revealing specific ways in which they can be efficiently simulated, predicted, and controlled.
Automata Theory by Javier Esparza
A comprehensive introduction to automata theory that uses the novel approach of viewing automata as data structures.
Structured planning and debugging | Proceedings of the 5th international joint conference on Artificial intelligence - Volume 2
We introduce a new approach to planning in STRIPS-like domains based on constructing and analyzing a compact structure we call a Planning Graph. We describe a new planner, Graphplan, that uses this paradigm. Graphplan always returns a shortest-possible ...
Circuit Tracing: Revealing Computational Graphs in Language Models
We describe an approach to tracing the “step-by-step” computation involved when a model responds to a single prompt.
All you need is data and functions
It's really easy to tend towards complexity as engineers. I think on some level, we love complexity. There are obviously bad types of complexity, but I think there are other types of it that we seek out, because there's something satisfying about wrapping your head around it; and I think a lot of that kind of complexity ends up in our programming languages.
Co-Creation: Systems Thinking Beyond the Machine
Complexity thinking is all the rage — in the arts and sciences. Yet, there are two different strands of thinking about complexity, which are often confounded. The first comes from cybernetics, focussing on control in complex situations. The second is ecological, aiming at sustainable participation in a reality beyond control. Their difference rests on a fundamental distinction: is complexity rooted in feedback regulation or collective co-creation? While feedback remains mechanistic, co-creation generates new spaces of possibilities. We need it to understand life and its evolution. And it empowers us to rewrite our future, to escape our mechanistic cage without abandoning scientific rigor. In this paper, we illustrate how we implement these powerful yet abstract principles through our artistic and philosophical practice.
The operad of wiring diagrams: formalizing a graphical language for databases, recursion, and plug-and-play circuits
Wiring diagrams, as seen in digital circuits, can be nested hierarchically and thus have an aspect of self-similarity. We show that wiring diagrams form the morphisms of an operad $\mcT$, capturing this self-similarity. We discuss the algebra $\Rel$ of mathematical relations on $\mcT$, and in so doing use wiring diagrams as a graphical language with which to structure queries on relational databases. We give the example of circuit diagrams as a special case. We move on to show how plug-and-play devices and also recursion can be formulated in the operadic framework as well. Throughout we include many examples and figures.
Keynote: Reproducibility and replicability of computer simulations | Canal U
Since the early days of the reproducibility crisis, much progress has been made in understanding and improving computational reproducibility and replicability (R and R)...
Why embracing complexity is the real challenge in software today
In the midst of industry discussions about productivity and automation, it’s all too easy to overlook the importance of properly reckoning with complexity.
The Compendium
A compendium of insights about complexity structured as inter-linked cards by Alex Komoroske
Making Sense of Chaos
From a pioneer in the field of complexity science and chaos theory, a plan for solving the world’s most pressing problems “Farmer convincingly argues t...
RSI Simulator: Play the Economics of Recursive Self-Improvement
Bootstrap an AI lab from scratch. A web game from Paradigm built on real economic models of AI recursive self-improvement.
