Computational chaos reports the artificial generation or suppression of chaotic behaviour in digital computers. There is a significant interest of the scientific community in analysing and understanding computational chaos of discrete and continuous systems. Notwithstanding, computational chaos in complex networks has received much less attention. In this article, we report computational chaos in a network of coupled logistic maps. We consider two types of networks, namely the Erdös–Rényi random network and the Barabási–Albert scale-free network. We show that there is an emergence of computational chaos when two different natural interval extensions are used in the simulation. More surprisingly, we also show that this chaos can be suppressed by an average of natural interval extensions, which can thus be considered as a filter to reduce the uncertainty stemming from the inherent finite precision of computer simulations.