BFF: Simple explanations for complex phenomena

• URL: http://arxiv.org/abs/2607.01483v1
• Date: Wed, 01 Jul 2026 21:24:12 GMT
• Title: BFF: Simple explanations for complex phenomena
• Abstract summary: We argue that paired interactions in a computational soup are an effective way to find self-replicators.<n>We explore the alternate hypothesis that self-replicators can be found at least as easily using simple mutation random walks in program space.
• Score: 4.504902185019815
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The ''Computational Life'' paper (Agüera y Arcas et al., 2024) argues that paired interactions in a computational soup are an effective way to find self-replicators. In this work, aided by recent developments in self-replicator detection, we explore the alternate hypothesis that self-replicators can be found at least as easily using simple mutation random walks in program space. We also explore the claim that capping the maximum ''depth'' and ''width'' of the ancestry tree stops self-replicators from emerging, showing instead that it merely stops self-replicators from taking over the soup.

Related papers

• Co-evolution of self-replication and function in a digital primordial soup [4.677439892464849]
  Self-replication can emerge spontaneously within digital primor soupsdial''<n>This paper investigates the co-evolution of this emergent self-replication alongside problem-solving capabilities.
  arXiv  Detail & Related papers  (2026-07-10T08:59:25Z)
• AutoResearchClaw: Self-Reinforcing Autonomous Research with Human-AI Collaboration [175.74514061083195]
  We present AutoResearchClaw, a multi-agent autonomous research pipeline built on five mechanisms.<n>On ARC-Bench, a 25-topic experiment-stage benchmark, AutoResearchClaw outperforms AI Scientist v2 by 54.7%.
  arXiv  Detail & Related papers  (2026-05-19T15:49:51Z)
• Rethinking Self-Replication: Detecting Distributed Selfhood in the Outlier Cellular Automaton [0.0]
  Spontaneous self-replication in cellular automata has long been considered rare.<n>We present formal, causal evidence that such replication can emerge unassisted.
  arXiv  Detail & Related papers  (2025-08-11T14:49:11Z)
• Open-ended Scientific Discovery via Bayesian Surprise [63.26412847240136]
  AutoDS is a method for open-ended scientific discovery that instead drives scientific exploration using Bayesian surprise.<n>We evaluate AutoDS in the setting of data-driven discovery across 21 real-world datasets spanning domains such as biology, economics, finance, and behavioral science.
  arXiv  Detail & Related papers  (2025-06-30T22:53:59Z)
• Computational Life: How Well-formed, Self-replicating Programs Emerge from Simple Interaction [37.95302339577743]
  We show that when random, non self-replicating programs are placed in an environment lacking any explicit fitness landscape, self-replicators tend to arise. We also show how increasingly complex dynamics continue to emerge following the rise of self-replicators.
  arXiv  Detail & Related papers  (2024-06-27T11:34:35Z)
• A Theoretical Understanding of Self-Correction through In-context Alignment [51.622068973630796]
  Large language models (LLMs) are capable of improving their abilities purely by self-correction. We show that when LLMs give relatively accurate self-examinations as rewards, they are capable of refining responses in an in-context way. Inspired by these findings, we also illustrate applications of self-correction, such as defending against LLM jailbreaks.
  arXiv  Detail & Related papers  (2024-05-28T22:33:02Z)
• Distilling Reasoning Ability from Large Language Models with Adaptive Thinking [54.047761094420174]
  Chain of thought finetuning (cot-finetuning) aims to endow small language models (SLM) with reasoning ability to improve their performance towards specific tasks.<n>Most existing cot-finetuning methods adopt a pre-thinking mechanism, allowing the SLM to generate a rationale before providing an answer.<n>This mechanism enables SLM to analyze and think about complex questions, but it also makes answer correctness highly sensitive to minor errors in rationale.<n>We propose a robust post-thinking mechanism to generate answers before rationale.
  arXiv  Detail & Related papers  (2024-04-14T07:19:27Z)
• Replication-proof Bandit Mechanism Design with Bayesian Agents [11.758708370032469]
  We study the problem of designing replication-proof bandit mechanisms when agents strategically register or replicate their own arms.<n>We consider Bayesian agents who only know the distribution from which their own arms' mean rewards are sampled, unlike the original setting of by Shin et al. 2022.
  arXiv  Detail & Related papers  (2023-12-28T08:36:35Z)
• Large Language Models for Automated Open-domain Scientific Hypotheses Discovery [50.40483334131271]
  This work proposes the first dataset for social science academic hypotheses discovery. Unlike previous settings, the new dataset requires (1) using open-domain data (raw web corpus) as observations; and (2) proposing hypotheses even new to humanity. A multi- module framework is developed for the task, including three different feedback mechanisms to boost performance.
  arXiv  Detail & Related papers  (2023-09-06T05:19:41Z)
• Generating User-Centred Explanations via Illocutionary Question Answering: From Philosophy to Interfaces [3.04585143845864]
  We show a new approach for the generation of interactive explanations based on a sophisticated pipeline of AI algorithms. Our contribution is an approach to frame illocution in a computer-friendly way, to achieve user-centrality with statistical question answering. We tested our hypotheses with a user-study involving more than 60 participants, on two XAI-based systems.
  arXiv  Detail & Related papers  (2021-10-02T09:06:36Z)
• Empirically Verifying Hypotheses Using Reinforcement Learning [58.09414653169534]
  This paper formulates hypothesis verification as an RL problem. We aim to build an agent that, given a hypothesis about the dynamics of the world, can take actions to generate observations which can help predict whether the hypothesis is true or false.
  arXiv  Detail & Related papers  (2020-06-29T01:01:10Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.