Use of the Kolmogorov complexity in analyzing control system dynamics
type: Item
instance of: scholarly article
title: Use of the Kolmogorov complexity in analyzing control system dynamics
zbMATH Open document ID: 0605.93048
author: E. A. Asarin
author: Alexei Pokrovskii
published in: Automation and Remote Control
publication date: 1986-01-01T00:00:00Z
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.
Mathematics Subject Classification ID: 93E03
Mathematics Subject Classification ID: 60H10
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 60D05
zbMATH DE Number: 3978948
zbMATH Keywords: Itô's equation
zbMATH Keywords: algorithmic probability
zbMATH Keywords: Kolmogorov complexity
MaRDI profile type: Publication
Recommended article: Q5675629
Recommended article: Q3778607
Recommended article: On the control of complex dynamic systems
Recommended article: The complexity of deciding controllability
Recommended article: Analysis of controllability of dynamic systems
Recommended article: Q4437834
Recommended article: Information and complexity in control systems: A tutorial
Recommended article: Complex dynamics in classical control systems
Recommended article: Q3615217
Recommended article: Dynamics control of the complex systems via nondifferentiability
description: scientific article; zbMATH DE number 3978948