On the public citation graph

Diagonally non-recursive functions and effective Hausdorff dimension

0 signed · 35 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.1007/3-540-45022-x_76openalex-snapshot
Gales and the Constructive Dimension of Individual Sequences
inferredcites →https://doi.org/10.1007/978-0-387-68441-3openalex-snapshot
Algorithmic Randomness and Complexity
inferredcites →https://doi.org/10.1007/s00493-011-2634-3openalex-snapshot
Binary subtrees with few labeled paths
inferredcites →https://doi.org/10.1016/j.apal.2005.06.004openalex-snapshot
On partial randomness
inferredcites →https://doi.org/10.1016/j.ipl.2008.05.028openalex-snapshot
Turing degrees of reals of positive effective packing dimension
inferredcites →https://doi.org/10.1016/s0020-0190(02)00343-5openalex-snapshot
A Kolmogorov complexity characterization of constructive Hausdorff dimension
inferredcites →https://doi.org/10.1016/s0890-5401(03)00187-1openalex-snapshot
The dimensions of individual strings and sequences
inferredcites →https://doi.org/10.1090/s0002-9947-1972-0316227-0openalex-snapshot
Π⁰₁ classes and degrees of theories
inferredcites →https://doi.org/10.2178/bsl/1107959497openalex-snapshot
Mass Problems and Randomness

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-319-20028-6_9openalex-snapshot
Degrees of Unsolvability: A Tutorial
inferred← citeshttps://doi.org/10.1007/978-3-319-50062-1_38openalex-snapshot
Effective Bi-immunity and Randomness
inferred← citeshttps://doi.org/10.1007/978-3-319-50062-1_40openalex-snapshot
Turing Degrees and Muchnik Degrees of Recursively Bounded DNR Functions
inferred← citeshttps://doi.org/10.1007/978-3-319-94418-0_10openalex-snapshot
From Eventually Different Functions to Pandemic Numberings
inferred← citeshttps://doi.org/10.1007/978-3-642-13962-8_26openalex-snapshot
The Strength of the Besicovitch-Davies Theorem
inferred← citeshttps://doi.org/10.1007/s00153-025-00995-0openalex-snapshot
On the hausdorff dimension of maximal chains and antichains of turing and hyperarithmetic degrees
inferred← citeshttps://doi.org/10.1007/s00224-018-9848-3openalex-snapshot
Effective Hausdorff Dimension in General Metric Spaces
inferred← citeshttps://doi.org/10.1007/s00493-011-2634-3openalex-snapshot
Binary subtrees with few labeled paths
inferred← citeshttps://doi.org/10.1007/s11856-021-2200-7openalex-snapshot
Highness properties close to PA completeness
inferred← citeshttps://doi.org/10.1007/s11856-023-2475-yopenalex-snapshot
The coding power of a product of partitions
inferred← citeshttps://doi.org/10.1016/j.aim.2010.06.024openalex-snapshot
Extracting information is hard: A Turing degree of non-integral effective Hausdorff dimension
inferred← citeshttps://doi.org/10.1016/j.apal.2014.03.001openalex-snapshot
Inside the Muchnik degrees II: The degree structures induced by the arithmetical hierarchy of countably continuous functions
inferred← citeshttps://doi.org/10.1016/j.ic.2016.12.008openalex-snapshot
Diagonally non-computable functions and fireworks
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.09.031openalex-snapshot
Dimension 1 sequences are close to randoms
inferred← citeshttps://doi.org/10.1017/bsl.2016.9openalex-snapshot
DEEP CLASSES
inferred← citeshttps://doi.org/10.1017/bsl.2017.12openalex-snapshot
FORCING WITH BUSHY TREES
inferred← citeshttps://doi.org/10.1017/fms.2016.3openalex-snapshot
DNR AND INCOMPARABLE TURING DEGREES
inferred← citeshttps://doi.org/10.1017/jsl.2013.7openalex-snapshot
MASS PROBLEMS AND INITIAL SEGMENT COMPLEXITY
inferred← citeshttps://doi.org/10.1090/noti1905openalex-snapshot
Computability and Randomness
inferred← citeshttps://doi.org/10.1090/s0002-9947-2014-06049-2openalex-snapshot
Cone avoiding closed sets
inferred← citeshttps://doi.org/10.1093/logcom/exz021openalex-snapshot
Effective aspects of Bernoulli randomness
inferred← citeshttps://doi.org/10.1145/3319408openalex-snapshot
Algorithmic randomness
inferred← citeshttps://doi.org/10.1215/00294527-3328401openalex-snapshot
Controlling Effective Packing Dimension of Δ20 Degrees
inferred← citeshttps://doi.org/10.2178/bsl.1902020openalex-snapshot
Shift-complex sequences
inferred← citeshttps://doi.org/10.26686/wgtn.17014586.v1openalex-snapshot
Topics in Algorithmic Randomness and Computability Theory
inferred← citeshttps://doi.org/10.48550/arxiv.1408.1999openalex-snapshot
Finding subsets of positive measure
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.