Nov 30th - Dec 3

This is the last week of this term, Danny did some reviewing with us.
First he talks about the possible topics in the exam, which covers all chapters we have learnt including quantifiers, implication,negation, venn diagram,connectives, proofs techniques, proving statements and structures, comments, algorithms, worst-case, big-Oh, big-Omega, big-Theta, limit technique and computability.And then he showed us some examples and tactics. Then, he talked to us about something we need to notice before and during the exam. Today, before the lecture, I was thinking about something I haven't figured out. It is about halting problems, if we say that meaning of life can be reduced to halt, then halt is included in the body of meaning of life, then there must be another function which contain f(i) and a return after it. But when we call meaning of life, it cannot be evaluate until f(i) halts, if f(i) does not halt, function meaning of life will never halt,too. So there is no such function to be called as a parameter inside meaning of life that accomplish the requirement 'if meaning of life halt, halt will also halt.' there is no code can express such function. We can only get its contradiction ' halt does not halt so does meaning of life'