Abstract
We investigate the computational capabilities of probabilistic cellular automata by means of the density classification problem. We find that a specific probabilistic cellular automata rule is able to solve the density classification problem, i.e. classifies binary input strings according to the number of 1’s and 0’s in the string, and show that its computational abilities are related to critical behaviour at a phase transition.