?{ }

Notebooks

Parallel and Distributed Computing

Last update: 06 Jul 2025 16:08
First version: Before 13 March 1995

Yet Another Inadequate Placeholder, last seriously updated in the early 2000s 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.


Notebooks: