Even disregarding the intrinsic necessity of some new
algorithm for numerical evaluation of one-loop diagrams, and
even in case it has no intrinsic necessity at all, a
probable decision about its goodness is possible inductively
by studying its success. Success here means fruitfulness in
consequences, in particular in verifiable consequences,
i.e., consequences demonstrable without the new algorithm,
whose proofs with the help of the new algorithm, however,
are considerably simpler and easier to discover, and make it
possible to contract into one proof many different proofs.