《The Master Algorithm》的笔记-Ch. II The master algorithm
- 章节名：Ch. II The master algorithm
- 2018-02-18 02:53:35
P and NP are the two most important classes of problems in computer science. A problem is in P if we can solve it efficiently, and it's in NP if we can efficiently check its solution. The famous P = NP question is whether every efficiently cheackable problem is also efficiently solvable.
知易行难。The future belongs to those who understand at a very deep level how to combine their unique expertise with what algorithms do best.
I want to become a superconsultant lolBesides, knowledge is not just a long list of facts. Knowledge is general, and has structure.
私对本书的所有笔记 · · · · · ·
The solution is to marry machine learning with game theory, something I've worked on in...
Ch. II The master algorithm
At this point you crumple your notes in frustration and fling the into the wastebasket....
Hebb's rule, as it has come to be known, is the cornerstone of connectionism. Indeed, t...
说明 · · · · · ·