6 ms·

I think the difference is in math the problem is fully specified and easily verifiable and in programming it's not. I don't agree that we always know we can sol

by fsmv 2mo ago

I think the difference is in math the problem is fully specified and easily verifiable and in programming it's not. I don't agree that we always know we can solve the problem.

vatsachak 2mo ago
Not always, sure but 90% of the time yes. For example, create a DFA for a regex, not too bad just use Thompson's algorithm and then NFA->DFA. But now we have to care about efficiency, user API, maintainability of definitions etc. Coding is more of a human problem than math