Boris Semenovich Darkhovsky, “О сложности и размерности непрерывных конечномерных отображений”, Теория вероятностей и ее применения, 65, № 3, 2020, 479
Douglas Cenzer, Christopher P. Porter, “Randomness extraction in computability theory”, COM, 12, № 1, 2023, 1
Verónica Becher, Olivier Carton, Pablo Ariel Heiber, “Finite-State Independence”, Theory Comput Syst, 62, № 7, 2018, 1555
Boris Darkhovsky, Alexandra Piryatinska, “Model‐free offline change‐point detection in multidimensional time series of arbitrary nature via ϵ‐complexity: Simulations and applications”, Appl Stoch Models Bus & Ind, 34, № 5, 2018, 633
Christopher P. Porter, “Length Functions and the Dimension of Points in Self-Similar Fractal Trees”, IEEE Trans. Inform. Theory, 69, № 10, 2023, 6221
Alexey Milovanov, 12730, Computer Science – Theory and Applications, 2021, 283
Tejas Bhojraj, “Generating Randomness from a Computable, Non-Random Sequence of Qubits”, SSRN Journal, 2022
Christopher Porter, “The Equivalence of Definitions of Algorithmic Randomness†”, Philosophia Mathematica, 2021, nkaa039
Alexander Shen, 13967, Unity of Logic and Computation, 2023, 120
Nikolai Konstantinovich Vereshchagin, Aleksei Lvovich Semenov, Alexander Khanievich Shen', “Последнее открытие Колмогорова? (Колмогоров и алгоритмическая статистика)”, Теория вероятностей и ее применения, 68, № 4, 2023, 719