3 ms·
Aren't programs generally more complex than math proofs? Like, the more accidental edge cases people produce, the less they understand the program.
by k__ 5y ago
Aren't programs generally more complex than math proofs?
Like, the more accidental edge cases people produce, the less they understand the program.
- freemint 5y agoNot any proof with quantifiers. As soon as statement contains ∀ (for all) ∃ (there exists one) where you have a way bigger branching factor and the claim after the quantifiers needs to be true all for all (or atleast for one) element of the set you draw from.
- k__ 5y agoYes, what I meant was, math proofs are well defined, and programs are often a heap of stuff thrown together. While it's harder to produce the math proof, it's probably harder to grasp what's going on in a program in a mathematical sense.