>>9,10
I was reorganizing some files on my system and stumbled across a list of problems I see in mathematics education. Interestingly one of these items was the prevalence of induction from examples which in proofs I claim discourages understanding and the skill of conjecture. I wonder why I didn't think to apply this to more foundational and algorithmic forms of mathematics as Sussman did? I think this was because I was missing the idea that the languages of computer science, be that programming languages, pseudo-code, or hoare logic are applicable in this context.