| Articolul precedent |
| Articolul urmator |
 |
 264 0 |
 SM ISO690:2012ALHAZOV, Artiom, IMAI, Katsunobu. Particle complexity of universal finite number-conserving cellular automata. In: Proceedings - 2016 4th International Symposium on Computing and Networking: CANDAR 2016, Ed. 4, 22-25 noiembrie 2016, Hiroshima. New Jersey, SUA: Institute of Electrical and Electronics Engineers Inc., 2017, Ediția a 4-a, pp. 209-214. ISBN 978-150902655-5. DOI: https://doi.org/10.1109/CANDAR.2016.97 |
| EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
 Proceedings - 2016 4th International Symposium on Computing and Networking Ediția a 4-a, 2017 |
||||||
|
Simpozionul "4th International Symposium on Computing and Networking, CANDAR 2016" 4, Hiroshima, Japonia, 22-25 noiembrie 2016 | ||||||
|
||||||
| DOI:https://doi.org/10.1109/CANDAR.2016.97 | ||||||
| Pag. 209-214 | ||||||
|
||||||
| Vezi articolul | ||||||
| Rezumat | ||||||
A number-conserving cellular automaton (NCCA) is a cellular automaton whose states are integers and whose transition function keeps the sum of all cells constant throughout its evolution. It can be seen as a kind of particle-based modeling of the physical conservation law of mass. In this paper we focus on the case we call finite NCCA when states are nonnegative integers, and the total sum is finite. In spite of the strong constraint, we constructed a radius 1 universal FNCCA by simulating register machines with two registers. We also consider the particle complexity in the case of large (but finite) radius, and constructed a universal FNCCA with only five particles. |
||||||
| Cuvinte-cheie Cellular automata, Number-conservation, Particle complexity, universality |
||||||
|
|
|
|
