Computational Aspects of Asynchronous CA

Details Computational Aspects of Asynchronous CA Computational Aspects of Asynchronous CA

2011-04-30

arxiv.org/abs/1105.0065v1

Computer Science

Formal Languages and Automata Theory

Scientific paper

This work studies some aspects of the computational power of fully asynchronous cellular automata (ACA). We deal with some notions of simulation between ACA and Turing Machines. In particular, we characterize the updating sequences specifying which are "universal", i.e., allowing a (specific family of) ACA to simulate any TM on any input. We also consider the computational cost of such simulations.

Affiliated with

Also associated with

No associations

Rating

Computational Aspects of Asynchronous CA does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Computational Aspects of Asynchronous CA, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computational Aspects of Asynchronous CA will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-65868