On the public citation graph
A Computable Measure of Algorithmic Probability by Finite Approximations with an Application to Integer Sequences
0 signed · 30 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/j.1538-7305.1962.tb00480.xopenalex-snapshot
On Non-Computable Functions
inferredcites →https://doi.org/10.1007/bf03024407openalex-snapshot
The miraculous universal distribution
inferredcites →https://doi.org/10.1016/j.amc.2011.10.006openalex-snapshot
Numerical evaluation of algorithmic complexity for short strings: A glance into the innermost structure of randomness
inferredcites →https://doi.org/10.1016/j.cognition.2014.11.038openalex-snapshot
Structure emerges faster during cultural transmission in children than in adults
inferredcites →https://doi.org/10.1016/j.physa.2014.02.060openalex-snapshot
Correlation of automorphism group size and topological properties with program-size complexity evaluations of graphs and complex networks
inferredcites →https://doi.org/10.1016/j.semcdb.2016.01.011openalex-snapshot
Methods of information theory and algorithmic complexity for network biology
inferredcites →https://doi.org/10.1016/s0019-9958(64)90131-7openalex-snapshot
A formal theory of inductive inference. Part II
inferredcites →https://doi.org/10.1080/00207166808803030openalex-snapshot
Three approaches to the quantitative definition of information *
inferredcites →https://doi.org/10.1080/13506285.2014.950365openalex-snapshot
Natural scene statistics mediate the perception of image complexity
inferredcites →https://doi.org/10.1090/s0025-5718-1983-0689479-6openalex-snapshot
The determination of the value of Rado’s noncomputable function Σ(𝑘) for four-state Turing machines
inferredcites →https://doi.org/10.1103/physreve.96.012308openalex-snapshot
Low-algorithmic-complexity entropy-deceiving graphs
inferredcites →https://doi.org/10.1111/j.1467-6419.2010.00666.xopenalex-snapshot
AN ALGORITHMIC INFORMATION THEORETIC APPROACH TO THE BEHAVIOUR OF FINANCIAL MARKETS
inferredcites →https://doi.org/10.1145/321495.321506openalex-snapshot
On the Length of Programs for Computing Finite Binary Sequences
inferredcites →https://doi.org/10.1371/journal.pcbi.1005408openalex-snapshot
Human behavioral complexity peaks at age 25
inferredcites →https://doi.org/10.3758/s13428-013-0416-0openalex-snapshot
Algorithmic complexity for short binary strings applied to psychology: a primer
inferredcites →https://doi.org/10.3758/s13428-015-0574-3openalex-snapshot
Algorithmic complexity for psychology: a user-friendly implementation of the coding theorem method
inferredcites →https://doi.org/10.7717/peerj-cs.23openalex-snapshot
Two-dimensional Kolmogorov complexity and an empirical validation of the Coding theorem method by compressibility
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s12539-019-00322-1openalex-snapshot
AC: A Compression Tool for Amino Acid Sequences
inferred← citeshttps://doi.org/10.1016/j.patcog.2021.107864openalex-snapshot
Automatic analysis of artistic paintings using information-based measures
inferred← citeshttps://doi.org/10.1038/s41467-026-73289-5openalex-snapshot
SuperARC: a test for artificial superintelligence based on compressed modelling, recursive prediction and problem complexity
inferred← citeshttps://doi.org/10.1098/rsos.180399openalex-snapshot
Algorithmically probable mutations reproduce aspects of evolution, such as convergence rate, genetic memory and modularity
inferred← citeshttps://doi.org/10.1177/0260107920913663openalex-snapshot
Quantifying Value with Effective Complexity
inferred← citeshttps://doi.org/10.3390/e20060393openalex-snapshot
Comparison of Compression-Based Measures with Application to the Evolution of Primate Genomes
inferred← citeshttps://doi.org/10.3390/e20070534openalex-snapshot
Symmetry and Correspondence of Algorithmic Complexity over Geometric, Spatial and Topological Representations
inferred← citeshttps://doi.org/10.3390/e21060560openalex-snapshot
The Thermodynamics of Network Coding, and an Algorithmic Refinement of the Principle of Maximum Entropy
inferred← citeshttps://doi.org/10.3390/e22040408openalex-snapshot
How Incomputable Is Kolmogorov Complexity?
inferred← citeshttps://doi.org/10.3390/e22060612openalex-snapshot
A Review of Methods for Estimating Algorithmic Complexity: Options, Challenges, and New Directions
inferred← citeshttps://doi.org/10.3390/e26090802openalex-snapshot
An Additively Optimal Interpreter for Approximating Kolmogorov Prefix Complexity
inferred← citeshttps://doi.org/10.4249/scholarpedia.53143openalex-snapshot
Algorithmic Information Dynamics
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.