It is shown that an infinite prime sequence can be generated in real-time by a cellular automaton having 1-bit inter-cell communications (CA1-bit). The algorithm presented is based on the classical sieve of Eratosthenes, and its implementation will be made on а СА1-bitusing 34 internal states and 71 transition rules.
2
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
We introduce a special new class of cellular automata(CA) whose inter-cell communication is restricted to 1-bit. Several design examples for 1-bit inter-cell communication cellular algorithms are given. It is shown that infinite non-regular sequences such as {2n | n = 1, 2, 3,..}, { n2 | n = 1, 2, 3,..} and Fibonacci sequences can be generated in real-time by cellular automata with 1-bit inter-cell communications. In addition, twice real-time prime generation algorithm is also given.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.