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
People also play games to get citations.
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.