While reading a book on Neural networks by Rojas, I encountered two statements in different places that seemed contradictory to me as I thought perceptrons and weighted McCulloch-Pitts networks are the same. The statements are:
Since McCulloch–Pitts networks do not use weighted edges the question of whether weighted networks are more general than unweighted ones must be answered. A simple example shows that both kinds of networks are equivalent.
A perceptron network is capable of computing any logical function, since perceptrons are even more powerful than unweighted McCulloch–Pitts elements.
How do they differ?
These two passages looks like taken out the context a bit. I think, the answer to your question can be found in the same work:
And later about negative weights:
So, the answer is: networks with weighted edges are simpler and tend to have more unified structure, they are easy to construct and train in comparison with unweighted networks.
I think, the idea of the author (about the power of perceptrons) is explained in the following paragraph:
This is why perceptrons are more powerful (meaning flexible and unified).