Yamidamian t1_j2j39b2 wrote
Reply to comment by suvlub in can someone explain the difference between quantum computing and classic computing in simpler words? how can quantum computing benefit us from a consumer perspective? by village_aapiser
How is prime factorization ‘unsolvable’ on a classic computer? It seems like something any programmer could pound out a simple program to do pretty easily.
It would be slow as heck for really big values, due to recursion involved, but it would eventually give a solution.
Is there some kind of math definition of ‘solved’ that I’m unfamiliar with?
suvlub t1_j2j4qhu wrote
Sorry, I was sloppy. "Solve in polynomial time" is what I meant.
Viewing a single comment thread. View all comments