This is the very last part of our class. It's also the most abstract part, making it extremely hard to understand. There's many problems in our life and many of them can be solved by computer. (we devise an algorithm and let computer finish the job) However, there are some problems that can not be solved by using computer!( It really sounds crazy: what? Have you ever heard nothing is impossible?!) But unfortunately, it is impossible for some kind of problem. Danny give an example of such problems: halting-problem. That kind of problem is not computable because there's no way to devise how the function works.
Until now, I still don't quite understand the meaning for this problem. I've heard about a crazy problem named " p=np?" I found many concept in our lecture are also involved in this problem and it is regard as the crown of computer science. We must admit that we knew so little about algorithm so far and there's still long way to go to even attempt proving that problem. I learned so much from this course. It let me explore the amazing world of computer science and I believe it'll be a good start.
No comments:
Post a Comment