"To search though all possible MD5 values is 2^128 operations which is massive. To be in with a good chance of finding a collision would take ~  2^64 operations which is again far too big for normal computing."

Seams weird, why so low to find collision compared to full search? or does the author not understand Exponentiation?