ConceptTheory & Algos
Termination argument
An argument using a variant function on a state space to prove that an algorithm terminates by decreasing in each step.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Lecturers
1Edsger W. Dijkstra
Connections
5The lectures that define it or assume it, and the concepts next to it.