The Natural Proofs BarrierResearch Paper
A circuit lower bound says that computing a particular Boolean function requires many logical gates. The natural proofs barrier identifies a limitation on a broad class of approaches to such bounds: under a strong pseudorandom-generator hardness assumption, a property cannot simultaneously be sufficiently common, efficiently recognizable from truth tables,…