Formal proof: achieving human-level AI through "learning" is inherently NP-hard
Six cognitive scientists have published a formal proof called the "Ingenia theorem": even under ideal conditions with perfect data, achieving human-level AI through learning remains an NP-hard problem, undermining the narrative that scaling inevitably leads to AGI.