Remix.run Logo
graycat 5 days ago

> What your wrote is ... not related to the topic of the article.

The article was: The Halting Problem is a terrible example of NP-Harder and I wrote:

> So, in this case can tell if the "program will stop" and, thus, solve "the halting problem".

> "Trivial"?

I never claimed the post was a significant contribution to computer science or complexity theory, and at most only a tiny fraction of posts at HN are such. Also, my post does not address the complexity theory question of P = NP.

If what I wrote was "new, correct, and significant", then I should have sent it to a good computer science journal. I've published enough papers in good math and computer science journals to notice that the checks take a long time to arrive. I'm not in academics and never wanted to be.

HN is not a journal of new, correct, and significant work in computer science.

From responses in this thread, the post has proven to be at least curious and interesting to some of the HN audience.