On the public citation graph
Eine Bemerkung zum Begriff der zuf�lligen Folge
0 signed · 25 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-642-95327-9openalex-snapshot
Aufzählbarkeit Entscheidbarkeit Berechenbarkeit
inferredcites →https://doi.org/10.1007/978-3-662-01462-2openalex-snapshot
Aufzählbarkeit, Entscheidbarkeit, Berechenbarkeit
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)x7022-3openalex-snapshot
Intuitionism an Introduction
inferredcites →https://doi.org/10.1016/s0049-237x(08)x7073-9openalex-snapshot
Intuitionism An Introduction
inferredcites →https://doi.org/10.1093/comjnl/12.1.28openalex-snapshot
Theory of Recursive Functions and Effective Computability
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.1515/9783112471586openalex-snapshot
Lehrbuch der Wahrscheinlichkeitsrechnung
inferredcites →https://doi.org/10.2307/2316720openalex-snapshot
Theory of Recursive Functions and Effective Computability.
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-642-88162-6_6openalex-snapshot
Turing-Maschinen und zufällige 0–1-Folgen
inferred← citeshttps://doi.org/10.1007/978-94-017-0837-1_12openalex-snapshot
A Survey of the Theory of Random Sequences
inferred← citeshttps://doi.org/10.1007/978-94-017-2973-4_13openalex-snapshot
The Combinatorial Foundations of Information Theory and the Probability Calculus
inferred← citeshttps://doi.org/10.1007/bf00533301openalex-snapshot
�ber die Definition von effektiven Zufallstests
inferred← citeshttps://doi.org/10.1007/bf00533302openalex-snapshot
�ber die Definition von effektiven Zufallstests
inferred← citeshttps://doi.org/10.1007/bf00538763openalex-snapshot
Klassifikation der Zufallsgesetze nach Komplexit�t und Ordnung
inferred← citeshttps://doi.org/10.1007/bf01084283openalex-snapshot
Complexity of algorithms and computations
inferred← citeshttps://doi.org/10.1007/bf01694181openalex-snapshot
A unified approach to the definition of random sequences
inferred← citeshttps://doi.org/10.1016/b978-0-444-88071-0.50009-6openalex-snapshot
Kolmogorov Complexity and its Applications
inferred← citeshttps://doi.org/10.1016/j.ic.2017.10.001openalex-snapshot
Schnorr randomness for noncomputable measures
inferred← citeshttps://doi.org/10.1070/rm1983v038n04abeh004203openalex-snapshot
Combinatorial foundations of information theory and the calculus of probabilities
inferred← citeshttps://doi.org/10.2307/2272862openalex-snapshot
General random sequences and learnable sequences
inferred← citeshttps://doi.org/10.48550/arxiv.1812.03375openalex-snapshot
On the close interaction between algorithmic randomness and constructive/computable measure theory
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.