CSC165 Week 10

We finished about the proof of big-Oh and big-Omega. Here is a short summary of chapter 4 about those proofs:

1. Definition of big-Oh, big-Omega.

2. big-Oh proofs for polynomials(standard procedure with over/underestimates)

3.big-Oh proofs for non-polynomials (need to use limits and L’Hopital’s rule)

4. proofs for general big-Oh statements(pick B and c based on known B’s and c’s)

 We also started chapter 5 this week. It's about the computability. For anything that in order to be computable for computers, that function can only go through by finite times. It can not be infinite. If the function is supposed have infinite loop inside, the result will never be computed.