Algorithmic randomness in continuous-time Markov chains

DOI10.1016/J.IC.2026.105502MaRDI QIDQ7353785zbMATH OpenFDO

Authors Xiang Huang, Jack H. Lutz, Neil Lutz, Andrei N. Migunov

Publication date 18 September 2026

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.IC.2026.105502

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A tutorial on conformal prediction
• A unified approach to the definition of random sequences
• Algorithmic randomness and complexity.
• An introduction to Kolmogorov complexity and its applications
• Bounding the dimension of points on a line
• Bounds on the dimension of lineal extensions
• Computability and randomness
• Computation with finite stochastic chemical reaction networks
• Demystifying Reachability in Vector Addition Systems
• Effective dimension of points visited by Brownian motion
• Endliche Automaten und Zufallsfolgen
• Ergodic theorems for individual random sequences
• Foundations of chemical reaction network theory
• Fractal Intersections and Products via Algorithmic Dimension
• Fractals generated by algorithmically random Brownian motion
• scientific article; zbMATH DE number 5485513 (Why is no real title available?)
• scientific article; zbMATH DE number 52121 (Why is no real title available?)
• scientific article; zbMATH DE number 1460545 (Why is no real title available?)
• scientific article; zbMATH DE number 2168212 (Why is no real title available?)
• scientific article; zbMATH DE number 765034 (Why is no real title available?)
• scientific article; zbMATH DE number 1399413 (Why is no real title available?)
• scientific article; zbMATH DE number 969633 (Why is no real title available?)
• scientific article; zbMATH DE number 3034028 (Why is no real title available?)
• Incompleteness theorems for random reals
• Kolmogorov Complexity and Algorithmic Randomness
• Kolmogorov complexity and the geometry of Brownian motion
• On zeros of Martin-Löf random Brownian motion
• Predictive complexity and generalized entropy rate of stationary ergodic processes
• Projection theorems using effective dimension
• THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
• The reachability problem for Petri nets is not elementary
• Who asked us? How the theory of computing answers questions about analysis

This page was built for publication: Algorithmic randomness in continuous-time Markov chains

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7353785)