Content deleted Content added
Undid revision 1228055946 by Ben Standeven (talk): no, it can serve as introductory sentence (although a better one might be devised) for the following subsections |
m mark dead link |
||
Line 54:
===Negative results===
* M. Kearns and [[Leslie Valiant]]. 1989. Cryptographic limitations on learning boolean formulae and finite automata. In Proceedings of the 21st Annual ACM Symposium on Theory of Computing, pages 433–444, New York. ACM. http://citeseer.ist.psu.edu/kearns89cryptographic.html{{dl|date=August 2024}}
===Error tolerance===
| |||