this is certainly true when you're considering the finest of algorithmic fu, (yay, that rhymes!) on the other hand, it worth mentioning that when you break ou

this is certainly true when you're considering the finest of algorithmic fu, (yay, that rhymes!) on the other hand, it worth mentioning that when you break out a computerize theorem prover to verify properties of say, a 15 line assembly bootloader, that winds up taking ~ 15k lines of code in the COQ theorem prover http://coq.inria.fr/ http://coq.inria.fr/ (granted a lot of it was in libraries that were reusable) as far as I can tell, proof engineering is the most technically challenging form of software engineering