Zobrazeno 1 - 10
of 34
pro vyhledávání: '"Balbi, Pedro Paulo"'
We present a sequential cellular automaton of radius 2 1 as a solution to the density classification task that makes use of an intermediate alphabet, and converges to a clean fixed point with no remaining auxiliary or intermediate information. We ext
Externí odkaz:
http://arxiv.org/abs/2409.06536
We present a family of automata networks that solve the k-parity problem when run in parallel. These solutions are constructed by connecting cliques in a non-cyclical fashion. The size of the local neighbourhood is linear in the size of the alphabet,
Externí odkaz:
http://arxiv.org/abs/2402.03306
Publikováno v:
In Journal of Computational Science October 2024 82
While advances in quantum hardware occur in modest steps, simulators running on classical computers provide a valuable test bed for the construction of quantum algorithms. Given a unitary matrix that performs certain operation, obtaining the equivale
Externí odkaz:
http://arxiv.org/abs/2106.03115
Publikováno v:
In Information Sciences May 2024 666
Publikováno v:
In Information Sciences November 2022 615:578-603
Publikováno v:
In Communications in Nonlinear Science and Numerical Simulation January 2022 104
An asynchronous solution to the synchronisation problem for binary one-dimensional cellular automata
Publikováno v:
In Physica D: Nonlinear Phenomena December 2020 413
Maximum sensitivity to update schedules of elementary cellular automata over infinite configurations
Publikováno v:
In Information and Computation October 2020 274
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.