Validating connectionist implementations

We present a method for validating implementations of connectionist algorithms by comparison with known versions. The method is dependent on a statistical model derived from work in multiversion programming techniques. We present example results which reveal that two variations of the backpropagation algorithm which are widely accepted as mere implementation variants do actually produce networks with some levels of differences. It is suggested that this method could be a useful validation tool for developers of variants of known algorithms