کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
430808 688159 2006 18 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Construction universality in purely asynchronous cellular automata
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
Construction universality in purely asynchronous cellular automata
چکیده انگلیسی

Universality in cellular automata (CAs), first studied by von Neumann, has attracted much research efforts over the years, especially for CA employing synchronous timing. This paper proposes a computation- and construction-universal CA with a von Neumann neighborhood that is updated in a purely asynchronous way, rather than by the conventional but less efficient way of simulating synchronous CAs on asynchronous CAs. The proposed asynchronous CA is capable of implementing self-reproducing machines. Our model employs strongly symmetric cells with 15 states.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Journal of Computer and System Sciences - Volume 72, Issue 8, December 2006, Pages 1368-1385