AI Stack Exchange
2022-06-27 20:36 UTC
By Justaperson
AI-110-20220627-social-media-ed770cfa
What consequence would a polynomial time algorithm for SAT have on AGI?
$P$ vs $NP$ is a famous problem. We generally believe $P\neq NP$ . However suppose there is a polynomial time algorithm of order say $O((n+m)^2)$ or $O((n+m)^3)$ (a low degree polynomial complexity with small hidden constants) for $n$ variable SAT problem in $m$ clauses, then what consequence would it have on $AI$ and machine learning? Would $AGI$ be any closer?
$P$ vs $NP$ is a famous problem. We generally believe $P\neq NP$ . However suppose there is a polynomial time algorithm of order say $O((n+m)^2)$ or $O((n+m)^3)$ (a low degree polynomial complexity with small hidden constants) for $n$ variable SAT problem in $m$ clauses, then what consequence would it have on $AI$ and machine learning? Would $AGI$ be any closer?
Full article content could not be extracted automatically. Read the original below.
Source:
AI Stack Exchange
· ai.stackexchange.com