Barriers to Complexity-Theoretic Proofs that Achieving AGI Using Machine Learning is Intractable

Michael Guerzhoy
11/10/2024
cs.AIcs.CC

No confident code implementation found for this paper.

Abstract

A recent paper (van Rooij et al. 2024) claims to have proved that achieving human-like intelligence using learning from data is intractable in a complexity-theoretic sense. We identify that the proof relies on an unjustified assumption about the distribution of (input, output) pairs to the system. We briefly discuss that assumption in the context of two fundamental barriers to repairing the proof: the need to precisely define ``human-like," and the need to account for the fact that a particular machine learning system will have particular inductive biases that are key to the analysis.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{guerzhoy2024barriers,
  title  = {Barriers to Complexity-Theoretic Proofs that Achieving AGI Using Machine Learning is Intractable},
  author = {Michael Guerzhoy},
  year   = {2024},
  eprint = {2411.06498},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2411.06498v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2411.06498.svg)](https://codeofpaper.com/paper/2411.06498)

Discussion