Notebooks

Parallel and Distributed Computing

14 Jul 2011 12:22

Cellular automata are parallel, interacting finite state machines; some of them are Turing-equivalent, that is, can compute any computable function.

Complexity classes --- in space (memory), time, other resources?

What would analog parallel computing look like? (A partial differential equation, presumably.)

Uses: data mining, simulations.

See also: Computation, Automata, Languages; Computer Networks; Multi-Agent Systems


Notebooks: