| Home | << 1 >> |
|
| Records | |||||
|---|---|---|---|---|---|
| Author | Ruivo, E.L.P.; de Oliveira, P.P.B.; Montalva-Medel, M.; Perrot, K. | ||||
| Title | Maximum sensitivity to update schedules of elementary cellular automata over infinite configurations | Type | |||
Year  |
2020 | Publication | Information and Computation | Abbreviated Journal | Inf. Comput. |
| Volume | 274 | Issue | SI | Pages | 104538 |
| Keywords | |||||
| Abstract | Cellular automata are discrete dynamical systems with locally defined behaviour, well known as simple models of complex systems. Classically, their dynamics derive from synchronously iterated rules over finite or infinite configurations; however, since for many natural systems to be modelled, asynchrony seems more plausible, asynchronous iteration of the rules has gained a considerable attention in recent years. One question in this context is how changing the update schedule of rule applications affects the global behaviour of the system. In particular, previous works addressed the notion of maximum sensitivity to changes in the update schemes for finite lattices. Here, we extend the notion to infinite lattices, and classify elementary cellular automata space according to such a property. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | 0890-5401 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | Approved | ||||
| Call Number | UAI @ eduardo.moreno @ | Serial | 1122 | ||
| Permanent link to this record | |||||
| Author | Goles, E.; Montealegre, P. | ||||
| Title | The complexity of the asynchronous prediction of the majority automata | Type | |||
| Year |
2020 | Publication | Information and Computation | Abbreviated Journal | Inf. Comput. |
| Volume | 274 | Issue | SI | Pages | |
| Keywords | Majority automata; Cellular automata; Prediction problem; Asynchronous updating; Computational complexity; Parallel algorithms; Bootstrap percolation; NP-Completeness | ||||
| Abstract | We consider the asynchronous prediction problem for some automaton as the one consisting in determining, given an initial configuration, if there exists a non-zero probability that some selected site changes its state, when the network is updated picking one site at a time uniformly at random. We show that for the majority automaton, the asynchronous prediction problem is in NC in the two-dimensional lattice with von Neumann neighborhood. Later, we show that in three or more dimensions the problem is NP-Complete. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | 0890-5401 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | Approved | ||||
| Call Number | UAI @ eduardo.moreno @ | Serial | 1124 | ||
| Permanent link to this record | |||||
| Author | Goles, E.; Maldonado, D.; Montealegre, P.; Ollinger, N. | ||||
| Title | On the complexity of the stability problem of binary freezing totalistic cellular automata | Type | |||
| Year |
2020 | Publication | Information And Computation | Abbreviated Journal | Inf. Comput. |
| Volume | 274 | Issue | Pages | 21 pp | |
| Keywords | Cellular automata; Computational complexity; Freezing cellular automata; Totalistic cellular automata; Fast parallel algorithms; P-Complete | ||||
| Abstract | In this paper we study the family of two-state Totalistic Freezing Cellular Automata (TFCA) defined over the triangular and square grids with von Neumann neighborhoods. We say that a Cellular Automaton is Freezing and Totalistic if the active cells remain unchanged, and the new value of an inactive cell depends only on the sum of its active neighbors. We classify all the Cellular Automata in the class of TFCA, grouping them in five different classes: the Trivial rules, Turing Universal rules, Algebraic rules, Topological rules and Fractal Growing rules. At the same time, we study in this family the STABILITY problem, consisting in deciding whether an inactive cell becomes active, given an initial configuration. We exploit the properties of the automata in each group to show that: For Algebraic and Topological Rules the STABILITY problem is in NC. For Turing Universal rules the STABILITY problem is P-Complete. (C) 2020 Elsevier Inc. All rights reserved. | ||||
| Address | [Goles, Eric; Montealegre, Pedro] Univ Adolfo Ibanez, Fac Ingn & Ciencias, Santiago, Chile, Email: eric.chacc@uai.cl; | ||||
| Corporate Author | Thesis | ||||
| Publisher | Academic Press Inc Elsevier Science | Place of Publication | Editor | ||
| Language | English | Summary Language | Original Title | ||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | 0890-5401 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | WOS:000573267700008 | Approved | |||
| Call Number | UAI @ alexi.delcanto @ | Serial | 1238 | ||
| Permanent link to this record | |||||
| Author | Goles, E.; Maldonado, D.; Montealegre, P. | ||||
| Title | On the complexity of asynchronous freezing cellular automata | Type | |||
| Year |
2021 | Publication | Information and Computation | Abbreviated Journal | Inf. Comput. |
| Volume | 281 | Issue | Pages | 104764 | |
| Keywords | Cellular automata; Computational complexity; Freezing dynamics | ||||
| Abstract | In this paper we study the family of freezing cellular automata (FCA) in the context of asynchronous updating schemes. A cellular automaton is called freezing if there exists an order of its states, and the transitions are only allowed to go from a lower to a higher state. A cellular automaton is asynchronous if at each time-step only one cell is updated. We define the problem ASYNCUNSTABILITY, which consists in deciding there exists a sequential updating scheme that changes the state of a given cell. We begin showing that ASYNCUNSTABILITY is in NL for any one-dimensional FCA. Then we focus on the family of life-like freezing CA (LFCA). We study the complexity of ASYNCUNSTABILITY for all LFCA in the triangular and square grids, showing that almost all of them can be solved in NC, except for one rule for which the problem is NP-Complete. (C) 2021 Elsevier Inc. All rights reserved. |
||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | 0890-5401 | ISBN | Medium | ||
| Area | 0890-5401 | Expedition | Conference | ||
| Notes | WOS:000721215200020 | Approved | |||
| Call Number | UAI @ alexi.delcanto @ | Serial | 1490 | ||
| Permanent link to this record | |||||
| Author | Becker, F.; Montealegre, P.; Rapaport, I.; Todinca, I. | ||||
| Title | The role of randomness in the broadcast congested clique model | Type | |||
| Year |
2021 | Publication | Information and Computation | Abbreviated Journal | Inf. Comput. |
| Volume | 281 | Issue | Pages | 104669 | |
| Keywords | Distributed computing; Broadcast congested clique; Message size complexity; Private and public coins; Simultaneous multi-party communication | ||||
| Abstract | We study the role of randomness in the broadcast congested clique model. This is a message-passing model of distributed computation where the nodes of a network know their local neighborhoods and they broadcast, in synchronous rounds, messages that are visible to every other node. This works aims to separate three different settings: deterministic protocols, randomized protocols with private coins, and randomized protocols with public coins. We obtain the following results: If more than one round is allowed, public randomness is as powerful as private ran-domness. One-round public-coin algorithms can be exponentially more powerful than determin-istic algorithms running in several rounds. One-round public-coin algorithms can be exponentially more powerful than one-round private-coin algorithms. One-round private-coin algorithms can be exponentially more powerful than one-round deterministic algorithms. |
||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | 0890-5401 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | WOS:000721215200042 | Approved | |||
| Call Number | UAI @ alexi.delcanto @ | Serial | 1491 | ||
| Permanent link to this record | |||||