tag:blogger.com,1999:blog-2564777502681463717.post5609853447723039467..comments2018-07-09T05:49:55.142-04:00Comments on Teaching, Playing, and Programming: Score one for induction!Chris Okasakihttp://www.blogger.com/profile/18247315355264748920noreply@blogger.comBlogger7125tag:blogger.com,1999:blog-2564777502681463717.post-60036877128423002112009-04-02T04:07:00.000-04:002009-04-02T04:07:00.000-04:00Well my discrete math course (call "foundations of...Well my discrete math course (call "foundations of computer science") taught induction and recursion close together time frame wise. The biggest parts of the final were induction and writing some simple functions in standard ML.<BR/><BR/>That approach certainly seemed to work for me, but I haven't thought of asking around more.Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-2564777502681463717.post-47145597671320158262008-10-06T05:33:00.000-04:002008-10-06T05:33:00.000-04:00"If I were to write this text again, I would not d..."If I were to write this text again, I would not devote the whole course to this one technique, but spend most of the time on the use of practical algorithms -- like hashing -- and on developing the right intuition on how to use them in today's large scale distributed environments that we didn't have 20 years ago."<BR/><BR/>Udi, I wish you *would* write a new edition (or a new book)! Would be wqorth its weight in gold!<BR/><BR/>I don't think there is an algorithms text out there that addresses these issues.Ravihttps://www.blogger.com/profile/03630087669712445498noreply@blogger.comtag:blogger.com,1999:blog-2564777502681463717.post-62899947448783626502008-10-03T11:45:00.000-04:002008-10-03T11:45:00.000-04:00yeah, that's the book and the approach we used whe...yeah, that's the book and the approach we used when i took my Algorithms course at Purdue 4 years ago. I can't say it was an easy way to learn but once you get it you are set.Airikhttps://www.blogger.com/profile/02128698967173142733noreply@blogger.comtag:blogger.com,1999:blog-2564777502681463717.post-27305955917561138732008-10-03T02:37:00.000-04:002008-10-03T02:37:00.000-04:00It's very rewarding to read this 20 years later. ...It's very rewarding to read this 20 years later. You are right, of course, that many students do not get it. That was my experience too. But many do. And for those, this is a powerful way of thinking that will improve their skills and their understanding. If I were to write this text again, I would not devote the whole course to this one technique, but spend most of the time on the use of practical algorithms -- like hashing -- and on developing the right intuition on how to use them in today's large scale distributed environments that we didn't have 20 years ago.Udihttps://www.blogger.com/profile/15289498088172295239noreply@blogger.comtag:blogger.com,1999:blog-2564777502681463717.post-23109895882327088212008-10-02T17:03:00.000-04:002008-10-02T17:03:00.000-04:00I've had the reverse experience. I already grokked...I've had the reverse experience. I already grokked recursion when I was introduced to proof by induction. The analogy to programming made learning the math much easier.Benjaminhttps://www.blogger.com/profile/06926765927236871090noreply@blogger.comtag:blogger.com,1999:blog-2564777502681463717.post-35955435161903793612008-10-02T10:03:00.000-04:002008-10-02T10:03:00.000-04:00I've explained writing recursive functions as anal...I've explained writing recursive functions as analogous to proving things by induction to two different math students with great, even instant, success. Of course, my CS students tend to not understand induction, so I see the problem you mention...Omar AntolĂn Camarenahttps://www.blogger.com/profile/06206510761450721045noreply@blogger.comtag:blogger.com,1999:blog-2564777502681463717.post-36791053005353016922008-10-02T09:15:00.000-04:002008-10-02T09:15:00.000-04:00That sounds like an interesting book, I will have ...That sounds like an interesting book, I will have to take a look! <BR/><BR/>I have become interested lately in the reverse direction - I encounter many competent ML hackers that do not understand proofs, and I was interested in exploring teaching proofs by analogy to recursive programming. Do you know of any similar sources that teach this analogy?Robhttps://www.blogger.com/profile/05106663398227635415noreply@blogger.com