Jira Is Turing-Complete
Engineering folklore holds that Jira (Atlassian’s project-tracking tool) is Turing-complete. Existing claims point vaguely at automation features without exhibiting a reduction. This article supplies a proof, with setup instructions and execution trace.
[…]
Minsky proved this model Turing-complete (1967). Exhibiting it in Jira’s automation language therefore establishes the reduction. Here is how the model maps onto Jira:
Minsky Machine Jira Register A Count of linked issues of type Bug Register B Count of linked issues of type Task Program Counter Status of a single Epic issue Dispatch Table Jira Automation rules, one per instruction state Clock Automation-triggered transitions, or external re-triggering past chain caps
