Evidence map›Paper›PMID 30225028›Full record

ArticleRoyal Society open science2018

Algorithmically probable mutations reproduce aspects of evolution, such as convergence rate, genetic memory and modularity.

Santiago Hernández-Orozco, Narsis A Kiani, Hector Zenil

Abstract read
In one paragraph

Article in Royal Society open science, 2018. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 14 papers.

0numbers the graph read from it
0cells of the map it votes in
14citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

14 citing papers in PubMed.

  1. Review
  2. Article
  3. Article
  4. Review
  5. Article
  6. A Metric for the Entropic Purpose of a System.Entropy (Basel, Switzerland) · 2025
    Article
  7. Review
  8. Article
  9. Emergence and algorithmic information dynamics of systems and observers.Philosophical transactions. Series A, Mathematical, physical, and engineering sciences · 2022
    Article
  10. Article
  11. Review
  12. Article
  13. Article
  14. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

3 authors.

Santiago Hernández-OrozcoPosgrado en Ciencia e Ingeniería de la Computación, Universidad Nacional Autónoma de México (UNAM), Mexico.ORCID 0000-0001-6041-6700
Narsis A KianiAlgorithmic Dynamics Lab, Unit of Computational Medicine, SciLifeLab, Department of Medicine Solna, Centre for Molecular Medicine, Stockholm, Sweden.
Hector ZenilAlgorithmic Dynamics Lab, Unit of Computational Medicine, SciLifeLab, Department of Medicine Solna, Centre for Molecular Medicine, Stockholm, Sweden.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Natural selection explains how life has evolved over millions of years from more primitive forms. The speed at which this happens, however, has sometimes defied formal explanations when based on random (uniformly distributed) mutations. Here, we investigate the application of a simplicity bias based on a natural but algorithmic distribution of mutations (no recombination) in various examples, particularly binary matrices, in order to compare evolutionary convergence rates. Results both on synthetic and on small biological examples indicate an accelerated rate when mutations are not statistically uniform but

Indexed as

algorithmic probabilityalgorithmic randomnessartificial evolutionartificial lifebiological evolutionmetabiology

Identifiers

PMID30225028
PMCPMC6124114

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.