It is already been three weeks from the first day of the lecture.
Now I feel more comfort on the concepts of both inductions,
but the new topic from this week bothers me very much.
By using the round-robin domino example from the lecture notes, It wasn't very hard to understand the definition of the well-ordering principle: every "non-empty set" of positive elements contains a minimal element. but its approach to solving a problem is still a mystery to me. because to me, it is a common sense to know that there is always a smallest element in a set, if the set is non-empty, but questions always asks me to prove "logically" this type of thing...
but I believe that like I couldn't find anything in common between binary tree and inductions,
I will find in someday the connection between well-ordering and the logic as I move along the course.
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment