On the public citation graph

Randomness spaces

https://doi.org/10.1007/bfb0055103
0 signed · 34 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-58131-6_37openalex-snapshot
Randomness as an invariant for number representations
inferredcites →https://doi.org/10.1007/3-540-63774-5_100openalex-snapshot
A foundation for computable analysis
inferredcites →https://doi.org/10.1007/978-1-4684-6802-1openalex-snapshot
Complexity Theory of Real Functions
inferredcites →https://doi.org/10.1007/978-3-642-69965-8openalex-snapshot
Computability
inferredcites →https://doi.org/10.1007/978-3-662-02460-7openalex-snapshot
Recursively Enumerable Sets and Degrees
inferredcites →https://doi.org/10.1007/978-3-662-21717-7openalex-snapshot
Computability in Analysis and Physics
inferredcites →https://doi.org/10.1007/bf01203155openalex-snapshot
Grundlagen der Wahrscheinlichkeitsrechnung
inferredcites →https://doi.org/10.1007/bfb0028594openalex-snapshot
Recursively enumerable reals and chaitin Ω numbers
inferredcites →https://doi.org/10.1016/0304-3975(85)90208-7openalex-snapshot
Theory of representations
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.1016/s0019-9958(64)90223-2openalex-snapshot
A formal theory of inductive inference. Part I
inferredcites →https://doi.org/10.1016/s0019-9958(66)80018-9openalex-snapshot
The definition of random sequences
inferredcites →https://doi.org/10.1016/s0019-9958(84)80060-1openalex-snapshot
Randomness conservation inequalities; information and independence in mathematical theories
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/s0002-9904-1978-14552-2openalex-snapshot
Recursively enumerable sets and degrees
inferredcites →https://doi.org/10.1134/11122.1608-3253openalex-snapshot
Problems of Information Transmission
inferredcites →https://doi.org/10.1145/321356.321363openalex-snapshot
On the Length of Programs for Computing Finite Binary Sequences
inferredcites →https://doi.org/10.1145/321495.321506openalex-snapshot
On the Length of Programs for Computing Finite Binary Sequences
inferredcites →https://doi.org/10.1145/321892.321894openalex-snapshot
A Theory of Program Size Formally Identical to Information Theory
inferredcites →https://doi.org/10.3217/jucs-003-11-1241openalex-snapshot
Invariance Properties of Random Sequences
inferredcites →https://doi.org/10.4064/fm-44-1-61-71openalex-snapshot
On the definitions of computable real continuous functions

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.200410048openalex-snapshot
Specker sequences revisited
inferred← citeshttps://doi.org/10.1007/3-540-48321-7_45openalex-snapshot
The Kolmogorov complexity of real numbers
inferred← citeshttps://doi.org/10.1007/978-1-4471-0717-0_18openalex-snapshot
How Large is the Set of Disjunctive Sequences?
inferred← citeshttps://doi.org/10.1007/978-3-319-99987-6_11openalex-snapshot
Formulation of Composite Discrete Measures for Estimating Uncertainties in Probabilistic Databases
inferred← citeshttps://doi.org/10.1007/978-3-662-04978-5_7openalex-snapshot
Computably Enumerable Random Reals
inferred← citeshttps://doi.org/10.1007/s00224-013-9507-7openalex-snapshot
Feasible Analysis, Randomness, and Base Invariance
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.03.054openalex-snapshot
Uniform test of algorithmic randomness over a general space
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.05.001openalex-snapshot
When does randomness come from randomness?
inferred← citeshttps://doi.org/10.1016/s0890-5401(02)00034-2openalex-snapshot
Random elements in effective topological spaces with measure
inferred← citeshttps://doi.org/10.1017/s0960129508006646openalex-snapshot
Computability and information in models of randomness and chaos
inferred← citeshttps://doi.org/10.1080/10586458.2002.10504481openalex-snapshot
Computing a Glimpse of Randomness
inferred← citeshttps://doi.org/10.3390/sym10110638openalex-snapshot
Construction and Simulation of Composite Measures and Condensation Model for Designing Probabilistic Computational Applications
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.