There has been a while since I wrote my last blog, I will conclude my thoughts on each major topics taught in this course after mid October.
Program Correctness was seems to be the major topic in the later half of the course, at first, we were taught to prove programs that we know that are correct(binary search, merge sort), these I have no problem understanding or even proving them. I had problems with correctness proves that require programs that I design(A3 Q4), I actually have similar problems in other courses like STA247, which is a statistics course, you need to write programs to simulate some situation and analyze the data, I was stuck between two thoughts, is the program correct, or did I just don't understand how to prove.
This actually tells me that i need to work on mastering these proves, because I need to know that my program is correct and these program correctness proof provide me the tools..
Assignment 3 does give me some thought on how useful program correctness proves are, for example in question 3, we were asked to devise a DFSA and prove that it is correct, during the process of writing the proof, I realize that I could get rid of one of the states and the DFSA would still function.
FSA's are new concepts to me, although I have some experience with regular expression's before, I did not realize(and should have) the formal use of such "languages".
2012年12月4日 星期二
2012年10月5日 星期五
Since I have just started this blog today, I would summarize what I feel about that course over the weeks passed.
First week we learned about Simple induction, although the concept of simple induction was already taught in previous years, more example on induction never hurts. I would like to see more examples on induction about "real life" problems, like a Knight could cover all the gourds in a chessboard.
Second week was about complete induction, although this technique is proven true by using simple induction and well-ordering, the technique itself is harder to understand comparing to just simple induction. The domino example does not work that well in exampling complete induction in my opinion.
Felt kind of funny about tutorial getting canceled again and need to reschedule.
From third week on is about well ordering , I had not thought much about it, although I learn that it is crucial to to why induction proofs. Still trying to grasp concept
Started working on the assignment, tried learning about latex, but gave up, and tried to finish the assignment using Microsoft word instead. It was going well until I try to proof-read my work and failed to understand because I have handled the math formulas badly. So I decided to learn latex instead. It is strangely satisfyingly to see my proof in neatly arranged formulas.
First week we learned about Simple induction, although the concept of simple induction was already taught in previous years, more example on induction never hurts. I would like to see more examples on induction about "real life" problems, like a Knight could cover all the gourds in a chessboard.
Second week was about complete induction, although this technique is proven true by using simple induction and well-ordering, the technique itself is harder to understand comparing to just simple induction. The domino example does not work that well in exampling complete induction in my opinion.
Felt kind of funny about tutorial getting canceled again and need to reschedule.
From third week on is about well ordering , I had not thought much about it, although I learn that it is crucial to to why induction proofs. Still trying to grasp concept
Started working on the assignment, tried learning about latex, but gave up, and tried to finish the assignment using Microsoft word instead. It was going well until I try to proof-read my work and failed to understand because I have handled the math formulas badly. So I decided to learn latex instead. It is strangely satisfyingly to see my proof in neatly arranged formulas.
訂閱：
文章 (Atom)