On the public citation graph

Algorithmic randomness

0 signed · 42 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.1006/aima.2000.1945openalex-snapshot
The Descriptive Complexity of Brownian Motion
inferredcites →https://doi.org/10.1007/11786986_30openalex-snapshot
Extracting Kolmogorov Complexity with Applications to Dimension Zero-One Laws
inferredcites →https://doi.org/10.1007/978-3-642-39053-1_26openalex-snapshot
Computing K-Trivial Sets by Incomplete Random Sets
inferredcites →https://doi.org/10.1007/s00208-015-1209-9openalex-snapshot
On simply normal numbers to different bases
inferredcites →https://doi.org/10.1007/s00224-004-1122-1openalex-snapshot
Correspondence Principles for Effective Dimensions
inferredcites →https://doi.org/10.1007/s00224-009-9214-6openalex-snapshot
Two Sources Are Better than One for Increasing the Kolmogorov Complexity of Infinite Sequences
inferredcites →https://doi.org/10.1016/j.aim.2004.10.006openalex-snapshot
Lowness properties and randomness
inferredcites →https://doi.org/10.1016/j.aim.2010.06.024openalex-snapshot
Extracting information is hard: A Turing degree of non-integral effective Hausdorff dimension
inferredcites →https://doi.org/10.1016/j.apal.2014.04.009openalex-snapshot
The axiomatic power of Kolmogorov complexity
inferredcites →https://doi.org/10.1016/j.ic.2011.09.008openalex-snapshot
Limits on the computational power of random strings
inferredcites →https://doi.org/10.1016/j.jcss.2011.11.001openalex-snapshot
Fixed-point tile sets and their applications
inferredcites →https://doi.org/10.1016/j.tcs.2007.02.022openalex-snapshot
Turing’s unpublished algorithm for normal numbers
inferredcites →https://doi.org/10.1016/j.tcs.2017.09.031openalex-snapshot
Dimension 1 sequences are close to randoms
inferredcites →https://doi.org/10.1017/bsl.2013.3openalex-snapshot
COMPUTINGK-TRIVIAL SETS BY INCOMPLETE RANDOM SETS
inferredcites →https://doi.org/10.1088/0305-4470/34/35/312openalex-snapshot
Quantum algorithmic entropy
inferredcites →https://doi.org/10.1090/s0002-9939-2010-10513-0openalex-snapshot
Difference randomness
inferredcites →https://doi.org/10.1090/s0002-9947-08-04395-xopenalex-snapshot
On initial segment complexity and degrees of randomness
inferredcites →https://doi.org/10.1090/tran/6484openalex-snapshot
Randomness and differentiability
inferredcites →https://doi.org/10.1109/18.681318openalex-snapshot
Information distance
inferredcites →https://doi.org/10.1112/blms/bdr003openalex-snapshot
Diagonally non-recursive functions and effective Hausdorff dimension
inferredcites →https://doi.org/10.1112/jlms/jdm041openalex-snapshot
Using random sets as oracles
inferredcites →https://doi.org/10.1137/0206006openalex-snapshot
A Fast Monte-Carlo Test for Primality
inferredcites →https://doi.org/10.1137/050628994openalex-snapshot
Power from Random Strings
inferredcites →https://doi.org/10.1142/9789812705815_0005openalex-snapshot
TRIVIAL REALS
inferredcites →https://doi.org/10.1145/258533.258590openalex-snapshot
P = BPP if E requires exponential circuits
inferredcites →https://doi.org/10.1145/2603088.2603114openalex-snapshot
A quest for algorithmically random infinite structures
inferredcites →https://doi.org/10.1201/9781439865903openalex-snapshot
Logic Colloquium '02: Lecture Notes in Logic 27
inferredcites →https://doi.org/10.1215/00294527-2009-017openalex-snapshot
The K-Degrees, Low for K Degrees,and Weakly Low for K Sets
inferredcites →https://doi.org/10.2178/jsl/1096901774openalex-snapshot
Every 2-random real is Kolmogorov random
inferredcites →https://doi.org/10.2178/jsl/1120224726openalex-snapshot
Randomness, relativization and Turing degrees
inferredcites →https://doi.org/10.2178/jsl/1208359062openalex-snapshot
Complex tilings
inferredcites →https://doi.org/10.48550/arxiv.1011.4974openalex-snapshot
The Surprise Examination Paradox and the Second Incompleteness Theorem

What points at this work

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

inferred← citeshttps://doi.org/10.1016/j.ic.2023.105078openalex-snapshot
Extending the reach of the point-to-set principle
inferred← citeshttps://doi.org/10.1109/aiiot65859.2025.11105294openalex-snapshot
Verifying Isomorphic Cipher Reduction Using the y-Intercept from Collision Plots
inferred← citeshttps://doi.org/10.1109/aiiot65859.2025.11105375openalex-snapshot
Basics of Polymorphism in Encryption
inferred← citeshttps://doi.org/10.1109/ccwc60891.2024.10427812openalex-snapshot
Exploring Polymorphic Algorithms and Their Use in Cryptography
inferred← citeshttps://doi.org/10.1109/ccwc62904.2025.10903877openalex-snapshot
Using the y-intercept in Collision Attacks for Encryption
inferred← citeshttps://doi.org/10.1109/ccwc62904.2025.10903933openalex-snapshot
Is Internet Traffic Really Random?
inferred← citeshttps://doi.org/10.1109/isncc58260.2023.10323635openalex-snapshot
A Demonstrable Break of PCBC Mode
inferred← citeshttps://doi.org/10.1109/uemcon67449.2025.11267551openalex-snapshot
Calculating the Increased Speed of Polymorphic Encryption
inferred← citeshttps://doi.org/10.3233/com-220433openalex-snapshot
Algorithmically random series
inferred← citeshttps://doi.org/10.3390/computation9120146openalex-snapshot
The Reasonable Effectiveness of Randomness in Scalable and Integrative Gene Regulatory Network Inference and Beyond
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.