Dijkstra's notions about provable functions are probably more important during these times where LLMs are churning out hallucinated code.
Dijkstra's notions about provable functions are probably more important during these times where LLMs are churning out hallucinated code.
Do you mean something specific or his general approach to program correctness i.e. guarded commands, weakest precondition calculus etc. ?