Saturday, 15 November 2014

week 10

This week we reviewed a lot of the materials from last week. We reviewed big-Oh proofs for polynomials (standard procedure with over/underestimates) big-Oh proofs for non-polynomials (need
to use limits and L’Hopital’s rule). We practiced doing more proofs which is always helpful seeing as it is clearly one of the most important aspects in this course. I find these practise proofs helpful in remembering to use comments and what to write in these comments seeing as we seem to get marked a lot on the comments that we include.
 This week we also began learning about computability. We learned that computers solve problems using algorithms, but some problems are not easy to solve using an algorithm. This was demonstrated through halting. It is not possible for computers to solve the halting problem because the problem leads in a contradiction. We also discussed how reductions can be used to show that other functions are non computable.

No comments:

Post a Comment