Dynamic neighbourhood cellular automata

Authors:
Stefan Dantchev
Affiliations:
Department of Computer Science, Durham University, Durham, UK
Venue:
VoCS'08 Proceedings of the 2008 international conference on Visions of Computer Science: BCS International Academic Conference
Year:
2008

Citing 5
Cited 0

An overview of the firing squad synchronization problem

Proceedings on LITP spring school on Theoretical Computer Science on Automata networks
What is a “pointer machine”?

ACM SIGACT News
A new kind of science

A new kind of science
Theory of cellular automata: a survey

Theoretical Computer Science
Theory of Self-Reproducing Automata

Theory of Self-Reproducing Automata

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a defi nition of Cellular Automaton in which links between cells can change during the computation. This is done locally by each cell, which can reach the neighbours of its neighbours in a single computational step. We suggest that Dynamic Neighbourhood Cellular Automata can serve as a theoretical model for studying Algorithmic and Computational Complexity issues in the are of Ubiquitous Computing. We illustrate this approach by giving an optimal logarithmic time solution of the Firing Squad Synchronisation problem in our model, which is an exponential speed-up over classical Cellular Automata.