Use of the Kolmogorov complexity in analyzing control system dynamics

MaRDI QIDQ1084366zbMATH OpenFDO

Authors E. A. Asarin, Alexei Pokrovskii

Publication date 1986

Published in Automation and Remote Control (Search for Journal in Brave)

zbMATH Keywords

algorithmic probabilityItô's equationKolmogorov complexity

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Stochastic ordinary differential equations (aspects of stochastic analysis) (60H10) Analysis of algorithms and problem complexity (68Q25) Stochastic systems in control theory (general) (93E03)

Review text

The problem is to find such a describing method for a control system input random process that the output process can be described as a solution of Itô's equation. The solution method is based on the algorithmic probability theory and the theory of Kolmogorov complexity. The truly random functions are defined and their complex approximations are considered. Using the truly random input process complex approximation, it is shown that the solution for an output process can be obtained as a limit of solutions to Cauchy problems.

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; zbMATH DE number 5529977
• Dynamics control of the complex systems via nondifferentiability

Cited in

(10)

• Effective dimension of points visited by Brownian motion
• Algorithmically random series and Brownian motion
• Computability of probability measures and Martin-Löf randomness over metric spaces
• Dynamics of a generic Brownian motion: Recursive aspects
• On the descriptional complexity of systems and their output response
• Weihrauch-completeness for layerwise computability
• The descriptive complexity of stochastic integration
• Computable Measure Theory and Algorithmic Randomness
• On the algorithmic complexity of static structures
• On local times of Martin-Löf random Brownian motion

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)