This week we started learning about computability. I understood pretty much everything we did until the stuff on reductions. I found the building the halt function using the initialized function to be confusing. I think the most confusing thing for me was the f_prime function because I don't know where that comes from. I'll have to read the course notes to see if I can get a better understanding. If I don't I will have to go to office hours to try and get a better explanation.
We also big omega proofs and general big oh proofs. I liked the big omega proofs because they were polynomials and I find big oh and big omega proofs for polynomials are pretty easy. The general big oh proofs were much more trickier. You can't just follow a simple procedure to prove them like the proofs with polynomials. You actually have to use the definitions of each function being in big oh to come up with a B and a C. The tutorial questions are on general big oh proofs so that will be good practice for me to get more comfortable with them.
In tutorial, I think I got 2/2 on the quiz because it was a polynomial big oh proof and I really like those and can do them pretty easily so I found the quiz to be pretty easy.
No comments:
Post a Comment