On the public citation graph
Correspondence and Independence of Numerical Evaluations of Algorithmic Information Measures
0 signed · 46 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/978-1-4757-2606-0openalex-snapshot
An Introduction to Kolmogorov Complexity and Its Applications
inferredcites →https://doi.org/10.1007/bf03024407openalex-snapshot
The miraculous universal distribution
inferredcites →https://doi.org/10.1016/0300-9084(96)84763-8openalex-snapshot
Compression and genetic sequence analysis
inferredcites →https://doi.org/10.1016/j.aam.2007.01.001openalex-snapshot
Most programs stop quickly or never halt
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.1093/oso/9780195150704.003.0003openalex-snapshot
How to Define Complexity in Physics, and Why
inferredcites →https://doi.org/10.1142/9789812770837_0006openalex-snapshot
On the Kolmogorov-Chaitin Complexity for Short Sequences
inferredcites →https://doi.org/10.1142/9789814434058_0020openalex-snapshot
ON THE LENGTH OF PROGRAMS FOR COMPUTING FINITE BINARY SEQUENCES: STATISTICAL CONSIDERATIONS
inferredcites →https://doi.org/10.3917/quae.delah.2009.01openalex-snapshot
Complexit� al�atoire et complexit� organis�e
inferredcites →https://doi.org/10.48550/arxiv.0804.3459openalex-snapshot
Towards a stable definition of Kolmogorov-Chaitin complexity
inferredcites →https://doi.org/10.48550/arxiv.1212.6745openalex-snapshot
Two-Dimensional Kolmogorov Complexity and Validation of the Coding Theorem Method by Compressibility
inferredcites →https://doi.org/10.48550/arxiv.math/0303352openalex-snapshot
From Philosophy to Program Size
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-031-03986-7_8openalex-snapshot
Algorithmic Information Dynamics of Cellular Automata
inferred← citeshttps://doi.org/10.1007/978-3-319-61581-3_2openalex-snapshot
Boolean Analogical Proportions - Axiomatics and Algorithmic Complexity Issues
inferred← citeshttps://doi.org/10.1007/978-3-658-12153-2_22openalex-snapshot
Algorithmic Data Analytics, Small Data Matters and Correlation versus Causation
inferred← citeshttps://doi.org/10.1016/j.actpsy.2017.01.007openalex-snapshot
A preference for some types of complexity comment on “perceived beauty of random texture patterns: A preference for complexity”
inferred← citeshttps://doi.org/10.1016/j.cognition.2014.11.038openalex-snapshot
Structure emerges faster during cultural transmission in children than in adults
inferred← citeshttps://doi.org/10.1016/j.ecocom.2016.08.005openalex-snapshot
Measuring complexity to infer changes in the dynamics of ecological systems under stress
inferred← citeshttps://doi.org/10.1016/j.ijar.2018.07.005openalex-snapshot
Analogical proportions: From equality to inequality
inferred← citeshttps://doi.org/10.1016/j.ins.2025.122520openalex-snapshot
Minimal algorithmic information loss methods for dimension reduction, feature selection and network sparsification
inferred← citeshttps://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
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.1080/13506285.2014.950365openalex-snapshot
Natural scene statistics mediate the perception of image complexity
inferred← citeshttps://doi.org/10.1080/17445760.2018.1448932openalex-snapshot
Coding-theorem like behaviour and emergence of the universal distribution from resource-bounded algorithmic probability
inferred← citeshttps://doi.org/10.1093/comnet/cnv025openalex-snapshot
Quantifying loss of information in network-based dimensionality reduction techniques
inferred← citeshttps://doi.org/10.1093/nar/gkz750openalex-snapshot
Training-free measures based on algorithmic probability identify high nucleosome occupancy in DNA sequences
inferred← citeshttps://doi.org/10.1111/cogs.12601openalex-snapshot
Compression in Working Memory and Its Relationship With Fluid Intelligence
inferred← citeshttps://doi.org/10.1142/s0129626418500056openalex-snapshot
Algorithmic Complexity and Reprogrammability of Chemical Structure Networks
inferred← citeshttps://doi.org/10.3389/fncom.2022.956074openalex-snapshot
Approximations of algorithmic and structural complexity validate cognitive-behavioral experimental results
inferred← citeshttps://doi.org/10.3389/fpsyg.2016.00201openalex-snapshot
Developmental Abilities to Form Chunks in Immediate Memory and Its Non-Relationship to Span Development
inferred← citeshttps://doi.org/10.3390/e20080605openalex-snapshot
A Decomposition Method for Global Evaluation of Shannon Entropy and Local Estimations of Algorithmic 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.3758/s13414-020-02231-8openalex-snapshot
A compressibility account of the color-sharing bonus in working memory
inferred← citeshttps://doi.org/10.3758/s13421-023-01474-8openalex-snapshot
Can compression take place in working memory without a central contribution of long-term memory?
inferred← citeshttps://doi.org/10.3758/s13428-015-0574-3openalex-snapshot
Algorithmic complexity for psychology: a user-friendly implementation of the coding theorem method
inferred← citeshttps://doi.org/10.3917/anpsy1.202.0175openalex-snapshot
Children’s working memory develops at similar rates for sequences differing in compressibility
inferred← citeshttps://doi.org/10.4204/eptcs.128.9openalex-snapshot
Proceedings Machines, Computations and Universality 2013
inferred← citeshttps://doi.org/10.48550/arxiv.1212.6745openalex-snapshot
Two-Dimensional Kolmogorov Complexity and Validation of the Coding Theorem Method by Compressibility
inferred← citeshttps://doi.org/10.48550/arxiv.1411.1924openalex-snapshot
On the Complexity and Behaviour of Cryptocurrencies Compared to Other Markets
inferred← citeshttps://doi.org/10.48550/arxiv.1509.06338openalex-snapshot
Approximations of Algorithmic and Structural Complexity Validate Cognitive-behavioural Experimental Results
inferred← citeshttps://doi.org/10.7717/peerj-cs.23openalex-snapshot
Two-dimensional Kolmogorov complexity and an empirical validation of the Coding theorem method by compressibility
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.