Sciweavers

269 search results - page 17 / 54
» Computing with Probabilistic Cellular Automata
Sort
View
MFCS
1998
Springer
14 years 7 days ago
One Guess One-Way Cellular Arrays
One-way cellular automata with restricted nondeterminism are investigated. The number of allowed nondeterministic state transitions is limited to a constant. It is shown that a lim...
Thomas Buchholz, Andreas Klein, Martin Kutrib
CSFW
2007
IEEE
14 years 3 months ago
Approximated Computationally Bounded Simulation Relations for Probabilistic Automata
We study simulation relations for Probabilistic Automata that require transitions to be matched up to negligible sets provided that computation lengths are polynomially bounded. T...
Roberto Segala, Andrea Turrini
ICS
2010
Tsinghua U.
14 years 6 months ago
Cryptography by Cellular Automata or How Fast Can Complexity Emerge in Nature?
Computation in the physical world is restricted by the following spatial locality constraint: In a single unit of time, information can only travel a bounded distance in space. A ...
Benny Applebaum, Yuval Ishai, Eyal Kushilevitz