Here we look at one of the most important problems with regards to proving statements via induction: Sipser's problem 0.12, which asks to show why a proposed proof of a statement about "all horses have the same color" is incorrect. It really gets at the heart of why proofs are important, and why needing to justify every step in a proof is also important.
Thanks to the following supporters of the channel for helping support this video. If you want to contribute, links are below.
Dolev Abuhazira, Josh Hibschman, Micah Wood, Morgan Jones, Patrik Keinonen, Simone Glinz, Tao Su, Timothy Gorden, unit220, Valentine Eben
Easy Theory Website: www.easytheory.org
Discord: / discord
If you like this content, please consider subscribing to my channel: / @easytheory
▶ABOUT ME◀
I am a professor of Computer Science, and am passionate about it. I have taught many courses at several different universities, including several sections of undergraduate and graduate theory-level classes.
The views expressed in this video are not reflective of any of my current or former employers.
Негізгі бет Horses and Colors (Induction False "Proof")
Пікірлер: 6