Re:Study of non-programmers' solutions to programming proble...
by twa927 on Saturday April 16, 2016 @03:42PM
(#11511948)
Mathematical proofs of correctness of even simple programs WITHOUT the mentioned technicalities are very complex (multiple times longer than the actual programs). This suggests that there is a lot of inherent complexity in the core software.
[ Parent
| on HN ]
There are no comments on this comment yet.