Hacker News Reader

It would look like an algorithm that solves an NP-complete problem in polynomial time. (Isn't that obvious?)

Sure. And why does that seem any more feasible than a non-constructive proof?

I don't know. Why is the moon plaid?