We analyze the one-dimensional version of Jim Propp's P-machine, a simple deterministic process that simulates a random walk on ℤ. The ``output'' of the machine is astonishingly close to the expected behavior of a random walk, even on long intervals of space and time.