It's not going to do any of these things, because it's auto-complete.

No, it won't bypass P≠NP either.

What about P vs. NP? Is auto-complete able to create P solutions and then perform NP verification by interacting with experiment or calculation IO? Couldn't it test solutions faster than a human on problems with massive solution spaces like folding proteins or aligning electron-hole pairs?