Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

DLT
2009

favoriteEmaildiscussreport

107views Theoretical Computer Science» more DLT 2009»

Asymptotic Cellular Complexity

13 years 2 months ago

Asymptotic Cellular Complexity

Download www.lif.univ-mrs.fr

We show here how to construct a cellular automaton whose asymptotic set (the set of configurations it converges to) is maximally complex: it contains only configurations of maximal Kolmogorov complexity. This cellular automaton hence exhibits the most complex possible asymptotic behavior.

Bruno Durand, Victor Poupet

Real-time Traffic

Cellular Automaton | DLT 2009 | Maximal Kolmogorov Complexity | Possible Asymptotic Behavior | Theoretical Computer Science |

claim paper

Related Content

» Traced communication complexity of cellular automata

» Distributed MultiCell ZeroForcing Beamforming in Cellular Downlink Channels

» On Local Symmetries and Universality in Cellular Automata

» Absolute and Asymptotic Bounds for Online Frequency Allocation in Cellular Networks

» On the relationship between fuzzy and Boolean cellular automata

» Stochastic Minority on Graphs

» Computational complexity of dynamical systems The case of cellular automata

» On Cellular Capacity with Base Station Cooperation

» Generalised Entropy and Asymptotic Complexities of Languages

Post Info
More Details (n/a)

Added	17 Feb 2011
Updated	17 Feb 2011
Type	Journal
Year	2009
Where	DLT
Authors	Bruno Durand, Victor Poupet

Comments (0)