On the public citation graph
Algorithmic Randomness of Closed Sets
0 signed · 55 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.1007/978-3-030-11298-1openalex-snapshot
An Introduction to Kolmogorov Complexity and Its Applications
inferredcites →https://doi.org/10.1007/978-3-540-73001-9_14openalex-snapshot
K-Trivial Closed Sets and Continuous Functions
inferredcites →https://doi.org/10.1007/bf01203155openalex-snapshot
Grundlagen der Wahrscheinlichkeitsrechnung
inferredcites →https://doi.org/10.1007/bf01694181openalex-snapshot
A unified approach to the definition of random sequences
inferredcites →https://doi.org/10.1016/0304-3975(76)90005-0openalex-snapshot
Information-theoretic characterizations of recursive infinite strings
inferredcites →https://doi.org/10.1016/j.entcs.2006.08.016openalex-snapshot
Random Continuous Functions
inferredcites →https://doi.org/10.1016/s0019-9958(66)80018-9openalex-snapshot
The definition of random sequences
inferredcites →https://doi.org/10.1016/s0049-237x(08)70130-7openalex-snapshot
On the use of Diagonally Nonrecursive Functions
inferredcites →https://doi.org/10.1016/s0167-5060(08)x7015-3openalex-snapshot
Theories of Computational Complexity
inferredcites →https://doi.org/10.1016/s0304-3975(98)00069-3openalex-snapshot
Mathematical metaphysics of randomness
inferredcites →https://doi.org/10.1080/00207166808803030openalex-snapshot
Three approaches to the quantitative definition of information *
inferredcites →https://doi.org/10.1090/s0002-9904-1978-14552-2openalex-snapshot
Recursively enumerable sets and degrees
inferredcites →https://doi.org/10.1137/s0097539703446912openalex-snapshot
Effective Strong Dimension in Algorithmic Information and Computational Complexity
inferredcites →https://doi.org/10.1145/262301.1040343openalex-snapshot
Book Review: An introduction to Kolmogorov Complexity and its Applications Second Edition, 1997 by Ming Li and Paul Vitanyi (Springer (Graduate Text Series))
inferredcites →https://doi.org/10.1214/aoms/1177729330openalex-snapshot
A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
inferredcites →https://doi.org/10.2307/2274030openalex-snapshot
The degrees below a 1-generic degree < 0′
inferredcites →https://doi.org/10.2307/2586546openalex-snapshot
Arithmetical representations of Brownian motion I
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/malq.201200089openalex-snapshot
Computable randomness and betting for computable probability spaces
inferred← citeshttps://doi.org/10.1007/978-3-030-59234-9_7openalex-snapshot
Computable Measure Theory and Algorithmic Randomness
inferred← citeshttps://doi.org/10.1007/978-3-030-59234-9_8openalex-snapshot
Algorithmic Fractal Dimensions in Geometric Measure Theory
inferred← citeshttps://doi.org/10.1007/978-3-319-17142-5_4openalex-snapshot
Algorithmically Random Functions and Effective Capacities
inferred← citeshttps://doi.org/10.1007/978-3-319-94418-0_14openalex-snapshot
Online Computability and Differentiation in the Cantor Space
inferred← citeshttps://doi.org/10.1007/978-3-540-73001-9_14openalex-snapshot
K-Trivial Closed Sets and Continuous Functions
inferred← citeshttps://doi.org/10.1007/978-3-642-03073-4_12openalex-snapshot
Immunity for Closed Sets
inferred← citeshttps://doi.org/10.1007/978-3-642-03073-4_16openalex-snapshot
Members of Random Closed Sets
inferred← citeshttps://doi.org/10.1007/978-3-642-35722-0_8openalex-snapshot
Sub-computable Bounded Pseudorandomness
inferred← citeshttps://doi.org/10.1007/s00153-007-0060-4openalex-snapshot
Algorithmic randomness of continuous functions
inferred← citeshttps://doi.org/10.1007/s00153-009-0126-6openalex-snapshot
Random closed sets viewed as random recursions
inferred← citeshttps://doi.org/10.1007/s00224-012-9416-1openalex-snapshot
Effective Randomness of Unions and Intersections
inferred← citeshttps://doi.org/10.1007/s00224-017-9791-8openalex-snapshot
Layerwise Computability and Image Randomness
inferred← citeshttps://doi.org/10.1007/s00224-017-9824-3openalex-snapshot
The Random Members of a Π 1 0 ${\Pi }_{1}^{0}$ Class
inferred← citeshttps://doi.org/10.1016/j.apal.2011.06.010openalex-snapshot
Martin-Löf randomness and Galton–Watson processes
inferred← citeshttps://doi.org/10.1016/j.apal.2014.07.001openalex-snapshot
Dimension spectra of random subfractals of self-similar fractals
inferred← citeshttps://doi.org/10.1016/j.apal.2017.12.003openalex-snapshot
Martin–Löf random generalized Poisson processes
inferred← citeshttps://doi.org/10.1016/j.ic.2024.105181openalex-snapshot
Pathwise-randomness and models of second-order arithmetic
inferred← citeshttps://doi.org/10.1017/9781108781718.005openalex-snapshot
Algorithmic randomness and layerwise computability
inferred← citeshttps://doi.org/10.1017/jsl.2014.76openalex-snapshot
MARTIN-LÖF RANDOMNESS IN SPACES OF CLOSED SETS
inferred← citeshttps://doi.org/10.1017/jsl.2022.55openalex-snapshot
PA RELATIVE TO AN ENUMERATION ORACLE
inferred← citeshttps://doi.org/10.1093/logcom/exn021openalex-snapshot
K-Triviality of Closed Sets and Continuous Functions
inferred← citeshttps://doi.org/10.1145/3545114openalex-snapshot
The Intersection of Algorithmically Random Closed Sets and Effective Dimension
inferred← citeshttps://doi.org/10.1184/r1/6723938openalex-snapshot
Topics in algorithmic randomness and computable analysis
inferred← citeshttps://doi.org/10.2168/lmcs-10(4:15)2014openalex-snapshot
Sub-computable Boundedness Randomness
inferred← citeshttps://doi.org/10.2168/lmcs-7(3:16)2011openalex-snapshot
Algorithmic Randomness and Capacity of Closed Sets
inferred← citeshttps://doi.org/10.32513/tbilisi/1528768843openalex-snapshot
Immunity and Non-Cupping for Closed Sets
inferred← citeshttps://doi.org/10.4115/jla.2015.7.7openalex-snapshot
The interplay of classes of algorithmically random objects
inferred← citeshttps://doi.org/10.4204/eptcs.24.11openalex-snapshot
Effective Capacity and Randomness of Closed Sets
inferred← citeshttps://doi.org/10.48550/arxiv.1503.06322openalex-snapshot
The interplay of classes of algorithmically random objects
inferred← citeshttps://doi.org/10.48550/arxiv.1503.06328openalex-snapshot
Algorithmically random functions and effective capacities
inferred← citeshttps://doi.org/10.48550/arxiv.2104.12066openalex-snapshot
Pathwise-random trees and models of second-order arithmetic
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.