I was watching the videos from Skiena's Computational Biology Lectures, which is also available at youtube. In those videos, the professor made a statement that, most of the problems posed to computer scientists by biologists were proved to be NP-Complete. My questions are the following ones: ( Please forgive me, if I make blunders here in asking questions. I am not from CS background.)
- Do NP-Completeness imply no algorithm exist for that particular problem?
- The professor was talking about heuristic approaches where normal approaches fails. Do there exist 'heuristic' approaches in computer science to solve problems? If so , Can some one give examples. (I have heard of heuristic approaches in analog circuit design in electronics. But I am not sure. Music composition is heuristic , right?)
- Is Machine learning a solution to solve some computational problems, where traditional algorithmic solutions doesn't exist?