Use of the Kolmogorov complexity in analyzing control system dynamics
From MaRDI portal
(Redirected from Publication:1084366)
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)- On the descriptional complexity of systems and their output response
- On local times of Martin-Löf random Brownian motion
- On the algorithmic complexity of static structures
- Effective dimension of points visited by Brownian motion
- Dynamics of a generic Brownian motion: Recursive aspects
- Algorithmically random series and Brownian motion
- Computability of probability measures and Martin-Löf randomness over metric spaces
- Computable Measure Theory and Algorithmic Randomness
- Weihrauch-completeness for layerwise computability
- The descriptive complexity of stochastic integration
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)
