The following tidbits emerged while commenting handins in past instances as well as this instance of LPP.
Urban explorers shun wheels.They fearlessly cross the streetwhere no pedestrian has crossed before,like, ever.
A uniform notation has a way (1) to foster a unified understanding and (2) to support the detection of patterns, leading to modular programming, code reuse, and the generalization and reuse of eureka lemmas. In the short run, that may not be as thrilling as re-inventing the wheel at every twist and turn, but the induced intelligence of our programs and our proofs is vaster and lasts longer.
The Ostrich Strategy in Computing:If we don’t look for bugs, we don’t find them.
With a Biblical undertone:
Beware of induction proofs that do not use the induction hypothesis, for they are proofs by cases in disguise.
Beware of inductive specifications without induction step, for, well, they are not inductive.
Beware of recursive functions with no recursive calls, for they are just ordinary functions.
Beware of recursive definitions with no self-references, for they are not recursive at all.
With a Texas overtone:
A proof ain’t inductive if it ain’t got no induction hypotheses.
A specification ain’t inductive if it ain’t got no induction step.
A function ain’t recursive if it ain’t got no recursive call.
If it ain’t self-referential, don’t fix it.
With two forward references:
A recursive function with no base case is likely not to terminate, unless it is corecursive.
An inductive specification with no base case is probably coinductive.
Outside the box is where I live:To think outside the box,one must be (1) aware that there is a box,and (2) mindful of what is in this box.That is the purpose of education.
Loki (beatifically, and taking all the space): Mindfulness is everything.Dana (slightly miffed): Er... Do you mind?Halcyon (to himself, wondering): Is this a trick question or what?
Moved Section On uniformity and unity from another chapter to the present one [20 Aug 2024]
Created [16 Feb 2024]