On the public citation graph
Complexity oscillations in infinite binary sequences
0 signed · 84 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.1016/s0019-9958(66)80018-9openalex-snapshot
The definition of random sequences
inferredcites →https://doi.org/10.24033/bsmf.996openalex-snapshot
Sur la classification des ensembles de mesure nulle
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.48550/arxiv.1505.03587openalex-extracted
Pricing complexity options
inferred← citeshttps://doi.org/10.1006/inco.1996.0017openalex-snapshot
Completeness and Weak Completeness under Polynomial-Size Circuits
inferred← citeshttps://doi.org/10.1007/3-540-10003-2_95openalex-snapshot
Optimal unbounded search strategies
inferred← citeshttps://doi.org/10.1007/3-540-16486-3_97openalex-snapshot
Resource-bounded Kolmogorov complexity of hard languages
inferred← citeshttps://doi.org/10.1007/3-540-45022-x_76openalex-snapshot
Gales and the Constructive Dimension of Individual Sequences
inferred← citeshttps://doi.org/10.1007/3-540-55210-3_193openalex-snapshot
On complexity classes and algorithmically random languages
inferred← citeshttps://doi.org/10.1007/3-540-56279-6_70openalex-snapshot
Relativizations of the P=? NP and other problems: Some developments in structural complexity theory
inferred← citeshttps://doi.org/10.1007/3-540-56939-1_79openalex-snapshot
Computational depth and reducibility
inferred← citeshttps://doi.org/10.1007/3-540-57568-5_255openalex-snapshot
Relativizing complexity classes with Random Oracles
inferred← citeshttps://doi.org/10.1007/3-540-59042-0_59openalex-snapshot
Completeness and weak completeness under polynomial-size circuits
inferred← citeshttps://doi.org/10.1007/978-3-031-05988-9_11openalex-snapshot
Martingales in the Study of Randomness
inferred← citeshttps://doi.org/10.1007/978-3-319-06089-7_5openalex-snapshot
Finite State Incompressible Infinite Sequences
inferred← citeshttps://doi.org/10.1007/978-3-642-77735-6_4openalex-snapshot
Kolmogorov Complexity, Complexity Cores, and the Distribution of Hardness
inferred← citeshttps://doi.org/10.1007/978-3-642-80885-2_29openalex-snapshot
An Algorithmic Approach to Information Theory
inferred← citeshttps://doi.org/10.1007/978-3-7091-3008-7_7openalex-snapshot
Complexity and Information Theory
inferred← citeshttps://doi.org/10.1007/978-94-015-8208-7_8openalex-snapshot
Randomness, Unpredictability and Absence of Order: The Identification by the Theory of Recursivity of the Mathematical Notion of Random Sequence
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-9217-2_3openalex-snapshot
Kolmogorov Complexity in Perspective Part I: Information Theory and Randomness
inferred← citeshttps://doi.org/10.1007/bf01084283openalex-snapshot
Complexity of algorithms and computations
inferred← citeshttps://doi.org/10.1007/bf01578842openalex-snapshot
An observation on probability versus randomness with applications to complexity classes
inferred← citeshttps://doi.org/10.1007/bf01694181openalex-snapshot
A unified approach to the definition of random sequences
inferred← citeshttps://doi.org/10.1016/0020-0255(91)90021-lopenalex-snapshot
An almost machine-independent theory of program-length complexity, sophistication, and induction
inferred← citeshttps://doi.org/10.1016/0022-0000(92)90020-jopenalex-snapshot
Almost everywhere high nonuniform complexity
inferred← citeshttps://doi.org/10.1016/0304-3975(81)90083-9openalex-snapshot
Several results in program size complexity
inferred← citeshttps://doi.org/10.1016/0304-3975(86)90081-2openalex-snapshot
On the notion of infinite pseudorandom sequences
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00014-xopenalex-snapshot
Computational depth and reducibility
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.aim.2010.12.022openalex-snapshot
Oscillation in the initial segment complexity of random reals
inferred← citeshttps://doi.org/10.1016/j.ic.2006.07.003openalex-snapshot
Natural halting probabilities, partial randomness, and zeta functions
inferred← citeshttps://doi.org/10.1016/j.ic.2015.11.003openalex-snapshot
Finite state incompressible infinite sequences
inferred← citeshttps://doi.org/10.1016/j.ipl.2004.06.016openalex-snapshot
Characterising the Martin-Löf random sequences using computably enumerable sets of measure one
inferred← citeshttps://doi.org/10.1016/j.jc.2006.07.003openalex-snapshot
Natural halting probabilities, partial randomness, and zeta functions
inferred← citeshttps://doi.org/10.1016/j.shpsb.2004.06.003openalex-snapshot
Probabilistic issues in statistical mechanics
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.04.013openalex-snapshot
The Kolmogorov complexity of infinite words
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.03.026openalex-snapshot
Information measures for infinite sequences
inferred← citeshttps://doi.org/10.1016/s0019-9958(78)90062-1openalex-snapshot
Complexity dips in random infinite binary sequences
inferred← citeshttps://doi.org/10.1016/s0022-0000(73)80030-3openalex-snapshot
Process complexity and effective random tests
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00012-8openalex-snapshot
Kolmogorov complexity and cellular automata classification
inferred← citeshttps://doi.org/10.1016/s0890-5401(03)00187-1openalex-snapshot
The dimensions of individual strings and sequences
inferred← citeshttps://doi.org/10.1017/9781108781718.002openalex-snapshot
Key developments in algorithmic randomness
inferred← citeshttps://doi.org/10.1017/jsl.2024.5openalex-snapshot
REGAININGLY APPROXIMABLE NUMBERS AND SETS
inferred← citeshttps://doi.org/10.1017/s0022481200029728openalex-snapshot
Von Mises' definition of random sequences reconsidered
inferred← citeshttps://doi.org/10.1088/0305-4470/29/13/007openalex-snapshot
Amplification by stochastic interference
inferred← citeshttps://doi.org/10.1090/s0002-9947-08-04395-xopenalex-snapshot
On initial segment complexity and degrees of randomness
inferred← citeshttps://doi.org/10.1093/ietisy/e91-d.10.2517openalex-snapshot
Complexity Oscillations in Random Reals
inferred← citeshttps://doi.org/10.1093/philmat/nkaa039openalex-snapshot
The Equivalence of Definitions of Algorithmic Randomness†
inferred← citeshttps://doi.org/10.1109/18.605580openalex-snapshot
Computational power of neural networks: a characterization in terms of Kolmogorov complexity
inferred← citeshttps://doi.org/10.1109/icnc.2008.915openalex-snapshot
Generalization of Complexity Oscillations in Infinite Sequences
inferred← citeshttps://doi.org/10.1109/sct.1988.5265openalex-snapshot
Two decades of applied Kolmogorov complexity: in memoriam Andrei Nikolaevich Kolmogorov 1903-87
inferred← citeshttps://doi.org/10.1109/sct.1989.41813openalex-snapshot
Almost everywhere high nonuniform complexity
inferred← citeshttps://doi.org/10.1109/sct.1992.215400openalex-snapshot
On languages with very high information content
inferred← citeshttps://doi.org/10.1109/sfcs.1977.28openalex-snapshot
Several results in program size complexity
inferred← citeshttps://doi.org/10.1109/tit.1976.1055501openalex-snapshot
On the Complexity of Finite Sequences
inferred← citeshttps://doi.org/10.1109/tit.1979.1056080openalex-snapshot
On the algorithmic foundation of information theory
inferred← citeshttps://doi.org/10.1137/0222029openalex-snapshot
On Languages with Very High Space-Bounded Kolmogorov Complexity
inferred← citeshttps://doi.org/10.1137/1036051openalex-snapshot
Relativizations of the P =? NP and Other Problems: Developments in Structural Complexity Theory
inferred← citeshttps://doi.org/10.1137/s009753979324485xopenalex-snapshot
A New Approach to Formal Language Theory by Kolmogorov Complexity
inferred← citeshttps://doi.org/10.1142/9781783267972_0007openalex-snapshot
Randomness: Quantum Versus Classical
inferred← citeshttps://doi.org/10.1142/9789812794055_0001openalex-snapshot
FIVE LECTURES ON ALGORITHMIC RANDOMNESS
inferred← citeshttps://doi.org/10.1142/s0219749916400098openalex-snapshot
Randomness: Quantum versus classical
inferred← citeshttps://doi.org/10.1142/s179396232050021xopenalex-snapshot
Measuring nonlinearity by means of static parameters in Bernoulli binary sequences distribution: A brief approach
inferred← citeshttps://doi.org/10.1145/1008369.1008373openalex-snapshot
From the recursive function theory newsletter
inferred← citeshttps://doi.org/10.1145/356914.356918openalex-snapshot
Inductive Inference: Theory and Methods
inferred← citeshttps://doi.org/10.1145/800152.804910openalex-snapshot
The process complexity and effective random tests.
inferred← citeshttps://doi.org/10.1215/00294527-2009-017openalex-snapshot
The K-Degrees, Low for K Degrees,and Weakly Low for K Sets
inferred← citeshttps://doi.org/10.2178/jsl/1096901774openalex-snapshot
Every 2-random real is Kolmogorov random
inferred← citeshttps://doi.org/10.2178/jsl/1120224726openalex-snapshot
Randomness, relativization and Turing degrees
inferred← citeshttps://doi.org/10.31274/rtd-180813-11836openalex-snapshot
The complexity and distribution of computationally useful problems
inferred← citeshttps://doi.org/10.32545/encyclopedia201901.0001.v2openalex-snapshot
Time Regulated Dynamics
inferred← citeshttps://doi.org/10.3390/sym10110645openalex-snapshot
Geometrical Information Flow Regulated by Time Lengths: An Initial Approach
inferred← citeshttps://doi.org/10.4064/-43-1-157-166openalex-snapshot
On the need to adapt de Finetti's probability interpretation to QM
inferred← citeshttps://doi.org/10.4171/022-2/1openalex-snapshot
Algorithmic randomness and computability
inferred← citeshttps://doi.org/10.5821/ebook-9788498802795openalex-snapshot
Secuencias pseudoaleatorias para telecomunicaciones
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.