Related Experiment Video
Updated: May 20, 2026

Microstate and Omega Complexity Analyses of the Resting-state Electroencephalography
Published on: June 15, 2018
Generalized complexity measures and chaotic maps
1Department of Theoretical Physics, University of Debrecen, H-4010 Debrecen, Hungary.
Abstract:
The logistic and Tinkerbell maps are studied with the recently introduced generalized complexity measure. The generalized complexity detects periodic windows. Moreover, it recognizes the intersection of periodic branches of the bifurcation diagram. It also reflects the fractal character of the chaotic dynamics. There are cases where the complexity plot shows changes that cannot be seen in the bifurcation diagram.
Related Concept Videos
The Entropy as a State Function
State Space Representation
Consider an RLC circuit, a...
Entropy
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
SFG Algebra
Each node in an SFG corresponds to a variable, and the interactions between nodes are represented by branches with associated gains. When multiple branches lead into a node, the value at that node is the sum of the...
Entropy Change in Reversible Processes
The statement can be further generalized to prove that entropy is a state function. Take a cyclic process between any two points on a p-V diagram.

