Hacker News Reader

I've often thought that JIRA workflows are Turing complete, I was hoping your list would have evidence.

It’s funny to think of JIRA as Turing complete because when using JIRA nobody can complete any programs.

Well, everything halts then, so that just solved the Halting Problem.

But you need to prove that it halted - to you manager obviously - that's the impossible and stressful part.

But is it provable in nondeterministic polynomial stress?

Need to explain it to 10 managers if you work in enterprise software.