I really like how there are course notes designed specifically for this course but one downfall is the lack of practice questions. I don't expect them to be in course notes or else it would become a full blown textbook. Luckily, there's even a book mentioned in the course notes on page 5.2.
I think what was learned during the course was interesting but I can't contextualize most of the concepts it into my limited understanding of computer science. I came into this class with very little knowledge of computer science. As I come out of this class, I sort of understand the basics of logical notation and the basics of the fundamentals of proof problem solving and format. From what I understand from calculus, this will allow me to read more complex math to understand more math and computer science. The algorithmic analysis has let me peek into the complicated world of the process of writing a solution to a problem before any code is written. As for computability theory, I have no clue how the smart people like Cantor would have thought of using diagonalization to determine there are countable and uncountable infinities and I don't understand it enough to put this info in a context.
This slog ends with a boring bang!
No comments:
Post a Comment