Use of the Kolmogorov complexity in analyzing control system dynamics
zbMATH Open0605.93048MaRDI QIDQ1084366FDOQ1084366
Authors: E. A. Asarin, Alexei Pokrovskii 
Publication date: 1986
Published in: Automation and Remote Control (Search for Journal in Brave)
Recommendations
- scientific article; zbMATH DE number 3409233
- scientific article; zbMATH DE number 4039730
- On the control of complex dynamic systems
- The complexity of deciding controllability
- Analysis of controllability of dynamic systems
- scientific article; zbMATH DE number 2012414
- Information and complexity in control systems: A tutorial
- Complex dynamics in classical control systems
- scientific article
- Dynamics control of the complex systems via nondifferentiability
algorithmic probabilityKolmogorov complexity[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=It%EF%BF%BD%EF%BF%BD%27s+equation&go=Go It��'s equation]
Geometric probability and stochastic geometry (60D05) Analysis of algorithms and problem complexity (68Q25) Stochastic ordinary differential equations (aspects of stochastic analysis) (60H10) Stochastic systems in control theory (general) (93E03)
Cited In (10)
- On the algorithmic complexity of static structures
- Weihrauch-completeness for layerwise computability
- Computability of probability measures and Martin-Löf randomness over metric spaces
- Computable Measure Theory and Algorithmic Randomness
- Dynamics of a generic Brownian motion: Recursive aspects
- Algorithmically random series and Brownian motion
- The descriptive complexity of stochastic integration
- Effective dimension of points visited by Brownian motion
- On local times of Martin-Löf random Brownian motion
- On the descriptional complexity of systems and their output response
This page was built for publication: Use of the Kolmogorov complexity in analyzing control system dynamics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1084366)
