Computational learning theory: Difference between revisions

Content deleted Content added
Monkbot (talk | contribs)
m Task 18 (cosmetic): eval 3 templates: del empty params (4×);
m convert special characters (via WP:JWB)
Line 17:
Negative results often rely on commonly believed, but yet unproven assumptions,{{citation needed|date=October 2017}} such as:
 
* Computational complexity – [[P versus NP problem|P ≠ NP (the P versus NP problem)]];
* [[cryptography|Cryptographic]] – [[One-way function]]s exist.