Browsing by Author "Gacs, Peter"

OpenBU

Browsing by Author "Gacs, Peter"

Sort by: Order: Results:

  • Deterministic Computations Whose History Is Independent of the Order of Asynchronous Updating
    Gacs, Peter (Boston University Computer Science Department, 1995-11-18)
    Consider a network of processors (sites) in which each site x has a finite set N(x) of neighbors. There is a transition function f that for each site x computes the next state ξ(x) from the states in N(x). But these ...
  • A New Version of Toom's Proof
    Gacs, Peter (Boston University Computer Science Department, 1995-03-27)
    There are several proofs now for the stability of Toom's example of a two-dimensional stable cellular automaton and its application to fault-tolerant computation. Simon and Berman simplified and strengthened Toom's original ...
  • Reliable Cellular Automata with Self-Organization
    Gacs, Peter (Boston University Computer Science Department, 1998-01-05)
    In a probabilistic cellular automaton in which all local transitions have positive probability, the problem of keeping a bit of information for more than a constant number of steps is nontrivial, even in an infinite ...