Discrete analogue computing with rotor-routers

Details Discrete analogue computing with rotor-routers Discrete analogue computing with rotor-routers

2010-07-14

arxiv.org/abs/1007.2389v2

Nonlinear Sciences

Cellular Automata and Lattice Gases

To appear in Chaos Special Focus Issue on Intrinsic and Designed Computation

Scientific paper

Rotor-routing is a procedure for routing tokens through a network that can implement certain kinds of computation. These computations are inherently asynchronous (the order in which tokens are routed makes no difference) and distributed (information is spread throughout the system). It is also possible to efficiently check that a computation has been carried out correctly in less time than the computation itself required, provided one has a certificate that can itself be computed by the rotor-router network. Rotor-router networks can be viewed as both discrete analogues of continuous linear systems and deterministic analogues of stochastic processes.

Affiliated with

Also associated with

No associations

Rating

Discrete analogue computing with rotor-routers does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Discrete analogue computing with rotor-routers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Discrete analogue computing with rotor-routers will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-121228