Viewing a single comment thread. View all comments

Yamidamian t1_j2j39b2 wrote

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?

1

suvlub t1_j2j4qhu wrote

Sorry, I was sloppy. "Solve in polynomial time" is what I meant.

1