30 ms·
They’re saying that chess and bcrypt and some others can be brute forced. You are correct that Goldbach cannot be proven true via brute force. But again, a hyp
by paulddraper 1y ago
They’re saying that chess and bcrypt and some others can be brute forced.
You are correct that Goldbach cannot be proven true via brute force. But again, a hypothetical general halting machine may require impractical time — 14 million billion years.
So the idea that “if this existed we crack all sorts of hard problems/optimize” is not necessarily true.