Every story and comment from the Hacker News API, in a layout borrowed from 2001.
A comment on Accidentally Turing-Complete. Parent comment
That is literally the problem statement you gave. I was pointing out that it is very much not undecidable.
It might be (almost certainly is, in this case) computationally intractable both in the general case and in practice, but it's still decidable.
There are no comments on this comment yet.
That is literally the problem statement you gave. I was pointing out that it is very much not undecidable.
It might be (almost certainly is, in this case) computationally intractable both in the general case and in practice, but it's still decidable.