Content deleted Content added
m mark dead link |
GabrielleeeR (talk | contribs) m Added citation |
||
Line 13:
* Positive results{{spaced ndash}}Showing that a certain class of functions is learnable in polynomial time.
* Negative results{{spaced ndash}}Showing that certain classes cannot be learned in polynomial time.<ref>{{Cite book |last=Kearns |first=Michael |title=An Introduction to Computational Learning Theory |last2=Vazirani |first2=Umesh |date=August 15, 1994 |publisher=MIT Press |year=1994 |isbn=978-0262111935}}</ref>
Negative results often rely on commonly believed, but yet unproven assumptions,{{citation needed|date=October 2017}} such as:
| |||