This paper is not unremarkable. It's actually quite a surprising result. The only question is whether it's earth-shattering, or just a parlor trick. My money is on parlor-trick, but I don't understand the math well enough to be confident of that. I posted this here hoping to find someone who could shed some light on this question.
It is unremarkable - it has 5 citations since May 2022. I have papers with more cites from this year.
Edit: it's a parlor trick because they invent a decision procedure (bounds on maxima) and then prove something based on that premise:
> It will be shown that non-computability of the first derivative is not detectable by a Turing machine for two concrete examples
I wonder if they rigged the game hmmm. In general people do this kind of thing all the time to get published (build both a technique and a foil for their technique) and it's always a weak paper.
2. > it has 5 citations since May 2022 ... I have papers with more cites from this year ... In general people do this kind of thing all the time to get published
Your original response of "it has few citations so it's unremarkable" was also an NPC response, which I wouldn't have commented on except that you're calling other people's responses NPC responses.
> Your original response of "it has few citations so it's unremarkable"
I'm befuddled. it's right there at the root of this string of comments: my original response was "it's unremarkable because it's niche in a niche area". it's only when someone asked why, i responded with citations and etc. so my original comment was not NPC according to your assessment, and it's only in response to someone reasserting that i had to cite something.
The false decorum/hypocrisy is palpable: I don't see how a dismissive/flippant link to a generic stack exchange post is any better in terms "quality response".
You can't escalate to edgelordery just because you read something as dismissive, at least not on HN. Or in npc-jargon terms, Snowflake Edgelord is not a valid alignment/class combo.
Sure, but rings off to the ear: this 2 year old paper saying it proved a Turing machine could say if a Turing machine could enter infinite loop given a very particular problem class could possibly be big news, earth-shattering news, I need someone else to tell me if bounds checking is involved. thank God it made it to the front page, I submitted it so I could get someone else to tell me
