Linear functional classes over cellular automata

Cellular automata are a discrete dynamical system which models massively parallel computation. Much attention is devoted to computations with small time complexity for which the parallelism may provide further possibilities. In this paper, we investigate the ability of cellular automata related to f...

Full description

Bibliographic Details
Main Authors: Anaël Grandjean, Gaétan Richard, Véronique Terrier
Format: Article
Language:English
Published: Open Publishing Association 2012-08-01
Series:Electronic Proceedings in Theoretical Computer Science
Online Access:http://arxiv.org/pdf/1208.2764v1
id doaj-f1a4c0eb5e06402a993f041531b37e69
record_format Article
spelling doaj-f1a4c0eb5e06402a993f041531b37e692020-11-24T23:31:06ZengOpen Publishing AssociationElectronic Proceedings in Theoretical Computer Science2075-21802012-08-0190Proc. AUTOMATA&JAC 201217719310.4204/EPTCS.90.15Linear functional classes over cellular automataAnaël GrandjeanGaétan RichardVéronique TerrierCellular automata are a discrete dynamical system which models massively parallel computation. Much attention is devoted to computations with small time complexity for which the parallelism may provide further possibilities. In this paper, we investigate the ability of cellular automata related to functional computation. We introduce several functional classes of low time complexity which contain "natural" problems. We examine their inclusion relationships and emphasize that several questions arising from this functional framework are related to current ones coming from the recognition context. We also provide a negative result which explicits limits on the information transmission whose consequences go beyond the functional point of view.http://arxiv.org/pdf/1208.2764v1
collection DOAJ
language English
format Article
sources DOAJ
author Anaël Grandjean
Gaétan Richard
Véronique Terrier
spellingShingle Anaël Grandjean
Gaétan Richard
Véronique Terrier
Linear functional classes over cellular automata
Electronic Proceedings in Theoretical Computer Science
author_facet Anaël Grandjean
Gaétan Richard
Véronique Terrier
author_sort Anaël Grandjean
title Linear functional classes over cellular automata
title_short Linear functional classes over cellular automata
title_full Linear functional classes over cellular automata
title_fullStr Linear functional classes over cellular automata
title_full_unstemmed Linear functional classes over cellular automata
title_sort linear functional classes over cellular automata
publisher Open Publishing Association
series Electronic Proceedings in Theoretical Computer Science
issn 2075-2180
publishDate 2012-08-01
description Cellular automata are a discrete dynamical system which models massively parallel computation. Much attention is devoted to computations with small time complexity for which the parallelism may provide further possibilities. In this paper, we investigate the ability of cellular automata related to functional computation. We introduce several functional classes of low time complexity which contain "natural" problems. We examine their inclusion relationships and emphasize that several questions arising from this functional framework are related to current ones coming from the recognition context. We also provide a negative result which explicits limits on the information transmission whose consequences go beyond the functional point of view.
url http://arxiv.org/pdf/1208.2764v1
work_keys_str_mv AT anaelgrandjean linearfunctionalclassesovercellularautomata
AT gaetanrichard linearfunctionalclassesovercellularautomata
AT veroniqueterrier linearfunctionalclassesovercellularautomata
_version_ 1725538950647382016