On the public citation graph

How Incomputable Is Kolmogorov Complexity?

0 signed · 51 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.
Claim with ORCID
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.
See reference health

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-0-387-49820-1openalex-snapshot
An Introduction to Kolmogorov Complexity and Its Applications
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/978-3-030-11298-1openalex-snapshot
An Introduction to Kolmogorov Complexity and Its Applications
inferredcites →https://doi.org/10.1007/978-3-319-08019-2_42openalex-snapshot
Short Lists with Short Programs in Short Time – A Short Proof
inferredcites →https://doi.org/10.1007/978-3-319-11662-4_24openalex-snapshot
A Safe Approximation for Kolmogorov Complexity
inferredcites →https://doi.org/10.1007/s00037-014-0090-3openalex-snapshot
Short lists for shortest descriptions in short time
inferredcites →https://doi.org/10.1016/j.tcs.2004.05.008openalex-snapshot
Small Turing machines and generalized busy beaver competition
inferredcites →https://doi.org/10.1016/j.tcs.2016.07.016openalex-snapshot
Busy beaver machines and the observant otter heuristic (or how to tame dreadful dragons)
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.1017/jsl.2014.15openalex-snapshot
COMPLEXITY OF COMPLEXITY AND STRINGS WITH MAXIMAL PLAIN AND PREFIX KOLMOGOROV COMPLEXITY
inferredcites →https://doi.org/10.1070/rm1970v025n06abeh001269openalex-snapshot
THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
inferredcites →https://doi.org/10.1080/00207166808803030openalex-snapshot
Three approaches to the quantitative definition of information *
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.1098/rsta.2012.0091openalex-snapshot
Similarity and denoising
inferredcites →https://doi.org/10.1109/ccc.2013.19openalex-snapshot
Short Lists with Short Programs in Short Time
inferredcites →https://doi.org/10.1109/swct.1964.3openalex-snapshot
A lower bound RADO's sigma function for binary turing machines
inferredcites →https://doi.org/10.1109/tit.2005.844059openalex-snapshot
Clustering by Compression
inferredcites →https://doi.org/10.1112/plms/s2-42.1.230openalex-snapshot
On Computable Numbers, with an Application to the Entscheidungsproblem
inferredcites →https://doi.org/10.1145/2902945.2902957openalex-snapshot
A Brief on Short Descriptions
inferredcites →https://doi.org/10.1155/2017/7208216openalex-snapshot
A Computable Measure of Algorithmic Probability by Finite Approximations with an Application to Integer Sequences
inferredcites →https://doi.org/10.7551/mitpress/12274.003.0008openalex-snapshot
On Computable Numbers, with an Application to the Entscheidungsproblem (1936)

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.4984828openalex-extracted
Eeg-Based Bidirectional Recurrent Neural Network in Sleep Apnea Incident Detection
inferred← citeshttps://doi.org/10.1007/978-3-031-47896-3_3openalex-snapshot
FaKy: A Feature Extraction Library to Detect the Truthfulness of a Text
inferred← citeshttps://doi.org/10.1007/978-3-032-09176-5_4openalex-snapshot
Curious Coincidences and Kolmogorov Complexity
inferred← citeshttps://doi.org/10.1007/978-3-032-37883-5_7openalex-snapshot
ID-PRAM: An Information Distance Aware Perturbation Mechanism
inferred← citeshttps://doi.org/10.1007/s13194-024-00569-6openalex-snapshot
Theorem proving in artificial neural networks: new frontiers in mathematical AI
inferred← citeshttps://doi.org/10.1016/j.asoc.2021.107198openalex-snapshot
Evolving simple and accurate symbolic regression models via asynchronous parallel computing
inferred← citeshttps://doi.org/10.1016/j.biosystems.2024.105279openalex-snapshot
Construction of pan-cancer regulatory networks based on causal inference
inferred← citeshttps://doi.org/10.1016/j.biosystems.2026.105878openalex-snapshot
The noncomputability of immune reaction complexity: Algorithmic information gaps under effective constraints
inferred← citeshttps://doi.org/10.1016/j.jcmds.2024.100098openalex-snapshot
Estimating data complexity and drift through a multiscale generalized impurity approach
inferred← citeshttps://doi.org/10.1016/j.physa.2022.128339openalex-snapshot
A note on a priori forecasting and simplicity bias in time series
inferred← citeshttps://doi.org/10.1016/j.physrep.2023.12.002openalex-snapshot
Complex systems approach to natural language
inferred← citeshttps://doi.org/10.1080/23753234.2022.2032781openalex-snapshot
How technology influences information gathering and information spreading
inferred← citeshttps://doi.org/10.1098/rsif.2024.0916openalex-snapshot
Bounding phenotype transition probabilities via conditional complexity
inferred← citeshttps://doi.org/10.1109/smc58881.2025.11343562openalex-snapshot
One Spiking Neuron Classification Based on Kolmogorov Complexity
inferred← citeshttps://doi.org/10.1109/svcc65277.2025.11133625openalex-snapshot
A Novel Approach to the Detection of Stegomalware in PDFs Using Kolmogorov Complexity
inferred← citeshttps://doi.org/10.1109/trustcom66490.2025.00126openalex-snapshot
Deep Learning Assisted Reverse Engineering: Recognizing Encryption Loops in Ransomware
inferred← citeshttps://doi.org/10.1109/tvcg.2023.3338359openalex-snapshot
TCDM: Transformational Complexity Based Distortion Metric for Perceptual Point Cloud Quality Assessment
inferred← citeshttps://doi.org/10.1155/2022/1889348openalex-snapshot
A New Quantitative Definition of the Complexity of Organized Matters
inferred← citeshttps://doi.org/10.14293/pr2199.000442.v1openalex-snapshot
Bias and Error Mitigation in Software-Generated Data: An Advanced Search and Optimization Framework Leveraging Generative Code Models
inferred← citeshttps://doi.org/10.20944/preprints202208.0330.v1openalex-snapshot
Optima and Simplicity in Nature
inferred← citeshttps://doi.org/10.3390/ani13071174openalex-snapshot
Information Theory Opens New Dimensions in Experimental Studies of Animal Behaviour and Communication
inferred← citeshttps://doi.org/10.3390/bioengineering9020080openalex-snapshot
A Multiscale Partition-Based Kolmogorov–Sinai Entropy for the Complexity Assessment of Heartbeat Dynamics
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/e23121604openalex-snapshot
Kolmogorov Basic Graphs and Their Application in Network Complexity Analysis
inferred← citeshttps://doi.org/10.3390/e23121654openalex-snapshot
Computational Creativity and Aesthetics with Algorithmic Information Theory
inferred← citeshttps://doi.org/10.3390/e24040505openalex-snapshot
Consistent Quantification of Complex Dynamics via a Novel Statistical Complexity Measure
inferred← citeshttps://doi.org/10.3390/e24081082openalex-snapshot
Ladderpath Approach: How Tinkering and Reuse Increase Complexity and Information
inferred← citeshttps://doi.org/10.3390/e26090802openalex-snapshot
An Additively Optimal Interpreter for Approximating Kolmogorov Prefix Complexity
inferred← citeshttps://doi.org/10.48550/arxiv.2006.04258openalex-snapshot
Investigating Estimated Kolmogorov Complexity as a Means of Regularization for Link Prediction
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.