AI Chat AI Image Generator AI Video Text to Speech

Some results relating Kolmogorov complexity and entropy of amenable group actions

09/05/2018

∙

by Andrei Alpeev, et al.

∙

∙

It was proved by Brudno that entropy and Kolmgorov complexity for dynamical systems are tightly related. We generalize his results to the case of arbitrary computable amenable group.

page 1

page 2

page 3

page 4

research

∙ 11/28/2018

On the relation between topological entropy and restoration entropy

In the context of state estimation under communication constraints, seve...

0 Christoph Kawan, et al. ∙

research

∙ 11/19/2019

A topological dynamical system with two different positive sofic entropies

A sofic approximation to a countable group is a sequence of partial acti...

0 Dylan Airey, et al. ∙

research

∙ 06/06/2016

Undecidability and Irreducibility Conditions for Open-Ended Evolution and Emergence

Is undecidability a requirement for open-ended evolution (OEE)? Using me...

0 Santiago Hernández-Orozco, et al. ∙

research

∙ 06/27/2020

Generic Transformations Have Zero Lower Slow Entropy and Infinite Upper Slow Entropy

The notion of slow entropy, both upper and lower slow entropy, were defi...

0 Terry Adams, et al. ∙

research

∙ 06/27/2020

Genericity and Rigidity for Slow Entropy Transformations

The notion of slow entropy, both upper and lower slow entropy, was defin...

0 Terry Adams, et al. ∙

research

∙ 01/15/2023

Identifying Time Lag in Dynamical Systems with Copula Entropy based Transfer Entropy

Time lag between variables is a key characteristics of dynamical systems...

0 Jian Ma, et al. ∙

research

∙ 05/03/2019

Preservation of normality by non-oblivious group selection

We give two different proofs of the fact that non-oblivious selection vi...

0 Olivier Carton, et al. ∙