This week we learned some more techniques to prove Big-O and Big-Omega.
Using under-estimation tricks and over-estimation tricks make more easier to prove Big O and omega.
After this, Larry go thorough the introduction to computability. Them non-computable, halt, was hard to understand at first time however since i got the concept of halt and after couple of examples i found its quite easy.
No comments:
Post a Comment