@article {IOPORT.05998844,
    author       = {Chow, Timothy Y.},
    title        = {What is \dots a natural proof?},
    year         = {2011},
    journal      = {Notices of the American Mathematical Society},
    volume       = {58},
    number       = {11},
    issn         = {0002-9920},
    pages        = {1586-1587},
    publisher    = {American Mathematical Society, Providence, RI},
    abstract     = {The author considers the significance of a result from the famous paper by {\it A. Razborov} and {\it S. Rudich} [J. Comput. Syst. Sci. 55, No. 1, 24--35 (1997; Zbl 0884.68055)], that won them the 2007 G\"odel Prize, in the search for a ``natural proof" of the $\mathrm{P}\not=\mathrm{NP}$ problem. If a strategy for proving that $\mathrm{P}\not=\mathrm{NP}$ is to identify some property ${\cal P}$ such that some NP-hard function $T$ has the property ${\cal P}$ but no polynomial-time computable function has, then the Razborov-Rudich theorem says that the property ${\cal P}$ must be either hard (it is not efficiently computable) or not possessed by many functions (no random function possesses it with a non-negligible probability). In the paper under review the author discusses the significance of this observation from different points of view.},
    reviewer     = {Marat M. Arslanov (Kazan)},
    identifier   = {05998844},
}