Michael J. Mahon  writes:
> As Dijkstra said, “Testing can prove the presence of bugs, but never their
> absence.”
>
> As an example, consider testing a 32 x 32 bit multiply. The hardware will
> be long dead (along with the tester!) before the testing is complete.

2^64 possible inputs. Google did 2^63 iterations of the SHA-1
compression function recently. Your multiplier is testable (in that
sense) if you’re prepared to throw some money at it.

A 64x64 multipler would be another matter...

--
https://www.greenend.org.uk/rjk/

--- SoupGate-Win32 v1.05