Sep 2026· Zenodo (CERN European Organization for Nuclear Research)
Slime Mold and Myxomycetes ResearchNeural Networks and Reservoir Computing
Abstract
Overview Contemporary Large Language Model (LLM) agent architectures treat memory primarily as retrieval over an append-only retrospective log. This paradigm incurs four foundational operational pathologies: Retrospective bias: Memory prioritises what was logged over what is dynamically needed. Write-time salience fixation: Initial prompt context artificially locks memory priority. Absence of intrinsic decay: Unchecked accretion leads to noise saturation. Catastrophic semantic dilution: Unbounded flat vector searches degrade precision over long horizons. In this paper, we introduce Morphological Memory, a cognitive architecture grounded in the principles of basal cognition and non-neural morphogenesis (translating somatic bioelectric Vmem pattern memories, Physarum polycephalum memristive flow remodelling, and morphogenetic Active Inference). Four Architectural Pillars Prospective Memory Setpoints: Top-down homeostatic target states guiding dynamic memory configuration rather than passive past retrieval. Decay-Weighted Associative Graph Dynamics: Co-activation topology with dual-rate homeostatic anchoring and power-law decay. Filesystem Stigmergy as Extended Phenotype: Environmental modification and trace deposition as an integral cognitive substrate. Topological Gating: Structural isolation preventing unbounded cross-talk and prompt-space pollution. Empirical Baselines & Wipe-Resumption Benchmark All claims are paired with reproducible, open-source benchmarks in the companion simulation suite biofield_sim: Reservoir-Computing Baselines: Matched-protocol experiments (biofield_sim v0.5.0) indicate that conventional Echo State Networks outperform bioelectric-lattice and memristive substrates on linear memory capacity and NARMA-10, demonstrating that continuous reservoir dynamics alone are the wrong instrument for structured agent memory. Wipe-Resumption Benchmark: In an LLM-free evaluation (v0.6.0, 30 seeds), a decay-weighted associative graph achieves recall@8 = 0.61 following a complete context wipe (compared to 0.25 / chance for flat cosine similarity), while empirically quantifying write-time fixation. Negative Result on Literal Flux Remodelling: Evaluating Physarum tube-adaptation rules revealed that competitive branch pruning is the wrong inductive bias for associative recall, underperforming Hebbian decay across all tested exponents. The biological inspiration is retained while the literal flow rule is transparently withdrawn. Links & Code Availability Companion Code & Benchmarks: https://github.com/OpenTangent/biofield-sim Interactive Live Visualizer: https://opentangent.github.io/biofield-sim/ License: Creative Commons Attribution 4.0 International (CC-BY 4.0); Code under MIT License.
Agile methods continue to gain popularity. In particular, the Scrum method appears to be on the verge of becoming a de-facto standard in the industry, leading the so called Agile movement. While there are success stories and recommendations, there is little scientifically valid evidence of the challenges in the adoptio...
A. Marchenko, P. Abrahamsson· Agile Conference· 59 citations· ⚡11
A comprehensive taxonomy of the challenges faced when a medium-scale organization decided to adopt software platforms is provided, namely: business challenges, organizational challenges, technical challenges, and people challenges.
Yaser Ghanam, F. Maurer, P. Abrahamsson· Information and Software Tec...· 41 citations· ⚡3
It is shown that high article processing charges are not sufficiently justified by the publishers, which often lack transparency and may prevent authors from adopting OA.
D. Graziotin, Xiaofeng Wang, P. Abrahamsson· Scientometrics· 21 citations· ⚡1
MCGLPPI, a novel geometric representation learning framework that combines graph neural networks (GNNs) with the MARTINI molecular coarse-grained (CG) model to predict overall PPI properties accurately and efficiently, offers an effective and efficient solution for PPI overall property predictions.
Yang Yue, Shu Li, Yihua Cheng et al.· bioRxiv· 15 citations
Abstract Predicting properties from coordinate–category data—sets of vectors paired with categorical information—is fundamental to computational science, manifesting in materials science as predicting formation energies or elastic moduli from crystal structures. While large language models (LLMs) have increasingly been...
Nawaf Alampara, Santiago Miret, Kevin Maik Jablonka· Nature Computational Science· 13 citations
PepPCBench enables a robust evaluation of PFNN-based methods and supports their continued development for peptide-protein structure prediction, and highlights the influence of peptide length, conformational flexibility, and training set similarity on prediction accuracy.
Si-Long Zhai, Huifeng Zhao, Ji-Ke Wang et al.· Journal of Chemical Informat...· 13 citations· ⚡1
Related blog posts
MIT News · Artificial Intelligence· news.mit.eduOct 26, 2026
Machine-learning networks can learn without detailed instructions from a designer. Those that do may offer insight into how the brain reorganizes itself during learning.
MIT News · Artificial Intelligence· news.mit.eduJul 15, 2026
Assistant Professor Pat Pataranutaporn describes a new interface that lets everyday users glimpse inside an AI's neural network before their chatbot ever says a word.
Microsoft Research Blog· microsoft.comJul 13, 2026
Cryptographic code supports vital protections in modern computing systems. Learn how a new method helps verify code as developers write it while preserving speed and adaptability as it gets implemented and evolves. The post Verifying Rust cryptography in SymCrypt, from standards to code appeared first on Microsoft Research.
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.