A study of fuzzy and many-valued logics in cellular automata
| dc.creator | Mingarelli, Angelo B. | |
| dc.date | 2006-08-25 | |
| dc.date | 2007-05-28 | |
| dc.date.accessioned | 2026-07-07T08:05:52Z | |
| dc.date.available | 2026-07-07T08:05:52Z | |
| dc.description | In this paper we provide an analytical study of the theory of multi-valued and fuzzy cellular automata where the fuzziness appears as the result of the application of an underlying multi-valued or continuous logic as opposed to standard logic as used conventionally. Using the disjunctive normal form of any one of the 255 ECA's so defined, we modify the underlying logic structure and redefine the ECA within the framework of this new logic. The idea here is to show that the evolution of space-time diagrams of ECA's under even a probabilistic logic can exhibit non-chaotic behavior. This is looked at specifically for Probabilistic Rule 110, in contrast with Boolean Rule 110 which is known to be capable of universal computation. | |
| dc.description | Corrected version: Tables 1, 3 and 4 have a missing left-most diagonal, thus resulting in misleading data output. Minor typos in the text corrected as a result. Note that all table values are truncations of actual values | |
| dc.identifier | https://arxiv.org/abs/cs/0608097 | |
| dc.identifier | http://arxiv.org/abs/cs/0608097 | |
| dc.identifier | J. Cellular Automata, 1 (3) (2006), 233-252 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/130416 | |
| dc.subject | Logic in Computer Science | |
| dc.subject | Computational Complexity | |
| dc.subject | B.6.1; F.1.1; I.2.3 | |
| dc.title | A study of fuzzy and many-valued logics in cellular automata | |
| dc.type | text |