> if I used induction incorrectly, I could probably still trick them into thinking it's a valid proof because it looks like induction.
You mean like this one?
http://en.wikipedia.org/wiki/All_horses_are_the_same_color
My college calculus professor used this example when she was teaching induction.
Re:Programming is hard
by johnaspden on Thursday October 21, 2010 @06:11AM
(#1814875)
Beautiful. Thank you.
That's a perfect demonstration of the difference between epistemic induction (unprovable) and mathematical induction (provable).
Re:Programming is hard
by RiderOfGiraffes on Thursday October 21, 2010 @04:37AM
(#1814736)
Er, actually it's not. It is mathematical induction, but with a broken case.
In my experience, most people who go through math classes at a University, not to mention classes in High School, are mostly "blindly" following a template of how to do induction. They don't really understand the principle behind it, why it's a valid proof technique, etc. Put another way, if I used induction incorrectly, I could probably still trick them into thinking it's a valid proof because it looks like induction.
The same goes for a lot of things in Mathematics. The same also goes for recursion - most people don't really understand recursion (unless it's used at a "simple" level, like in Tree Recursion).