New answers tagged

-2

Machine learning is subject to the laws of computing complexity. The prime factorization problem is in the NP complexity class, possibly even NP-hard (not proven). That is why detecting primes is among the hardest problems in machine learning, and might not be possible at all with that approach. Quantum computers (QC) can do it in polynomial time, but ...


Top 50 recent answers are included