The following pages link to (Q3314114):
Displaying 30 items.
- Effective complexity of stationary process realizations (Q400883) (← links)
- Brudno's theorem for \(\mathbb{Z}^d\) (or \(\mathbb{Z}_+^d\)) subshifts (Q515582) (← links)
- Reexamination of an information geometric construction of entropic indicators of complexity (Q613216) (← links)
- Quantifying the complexity of geodesic paths on curved statistical manifolds through information geometric entropies and Jacobi fields (Q633725) (← links)
- Models and the dynamics of theory-building in physics. I: Modeling strategies (Q643103) (← links)
- Entropy and algorithmic complexity in quantum information theory (Q885683) (← links)
- A complexity approach to the soliton resolution conjecture (Q887096) (← links)
- Complexity for extended dynamical systems (Q930558) (← links)
- Information measures for infinite sequences (Q974755) (← links)
- Effective symbolic dynamics, random points, statistical behavior, complexity and entropy (Q1049402) (← links)
- Ergodic theorems for individual random sequences (Q1275009) (← links)
- Ergodic theorems and the basis of science (Q1292990) (← links)
- Some characteristics of complex behavior of orbits in dynamical systems (Q1406792) (← links)
- Compression and diffusion: a joint approach to detect complexity. (Q1419144) (← links)
- Recurrence near given sets and the complexity of the Casati-Prosen map (Q1776624) (← links)
- The calculi of emergence: Computation, dynamics and induction (Q1817022) (← links)
- Randomness on full shift spaces (Q1868530) (← links)
- Algorithmic analysis of irrational rotations in a single neuron model (Q1869962) (← links)
- Toward a dynamical model for prime numbers (Q1878002) (← links)
- Complexity, randomness, discretization: some remarks on a program of J. Ford (Q1963281) (← links)
- Detecting regular dynamics from time series using permutations slopes (Q2198437) (← links)
- Symbolic dynamics: entropy = dimension = complexity (Q2354582) (← links)
- Entropy and quantum Kolmogorov complexity: a quantum Brudno's theorem (Q2458453) (← links)
- Volume and Entropy of Regular Timed Languages: Discretization Approach (Q3184666) (← links)
- Gacs quantum algorithmic entropy in infinite dimensional Hilbert spaces (Q3189933) (← links)
- On the Complexity of Some Geometrical Objects (Q3460644) (← links)
- ON ENTROPIES AND COMPLEXITY FOR AMENABLE ACTIONS GROUPS (Q5213067) (← links)
- Predictability: a way to characterize complexity (Q5949629) (← links)
- Information and dynamical systems: A concrete measurement on sporadic dynamics (Q5954869) (← links)
- Information of sequences and applications (Q5958977) (← links)
