Definability by Horn formulas and linear time on cellular automata
N Bacquey, E Grandjean, F Olive - ICALP 2017-44th International …, 2017 - hal.science
We establish an exact logical characterization of linear time complexity of cellular automata
of dimension d, for any fixed d: a set of pictures of dimension d belongs to this complexity …
of dimension d, for any fixed d: a set of pictures of dimension d belongs to this complexity …
[PDF][PDF] Sublinear-Time Cellular Automata and Connections to Complexity Theory
A Modanese - 2022 - scholar.archive.org
Distributed computing studies models in which multiple computational units coordinate
themselves to work towards some common goal while having only limited resources at their …
themselves to work towards some common goal while having only limited resources at their …
Inductive definitions in logic versus programs of real-time cellular automata
E Grandjean, T Grente, V Terrier - Theoretical Computer Science, 2024 - Elsevier
Descriptive complexity provides intrinsic, ie machine-independent, characterizations of the
main complexity classes. On the other hand, logic can be useful for designing programs in a …
main complexity classes. On the other hand, logic can be useful for designing programs in a …
[PDF][PDF] Inductive definitions in logic versus programs of real-time cellular automata
E Grandjean, T Grente, V Terrier - submitted to TCS. Fév, 2020 - researchgate.net
Descriptive complexity provides intrinsic, that is, machine-independent, characterizations of
the major complexity classes. On the other hand, logic can be useful for designing programs …
the major complexity classes. On the other hand, logic can be useful for designing programs …
Caractérisation et programmation en théorie des langages et en logique des classes de complexité efficace des automates cellulaires
T Grente - 2020 - theses.hal.science
Les automates cellulaires constituent le modèle de calcul parallèle et local par excellence.
Comme pour tout modèle du parallélisme, leur programmation est réputée difficile. La …
Comme pour tout modèle du parallélisme, leur programmation est réputée difficile. La …