Jira is Turing-Complete

Summary

Nicolas Seriot Computation > Jira is Turing-Complete Building a Minsky Machine in Atlassian Automation 22nd May 2026 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. Mapping the Computational Model A Minsky register machine needs only two unbounded counters and a finite set of labeled instructions: INC r; goto S DEC r; if r == 0 goto S else goto S Or, in plain English: increment register R, then goto some state decrement register R, if R == 0 goto some state, else goto some other state A Minsky program that adds register A into register B looks like: 1. DEC A; if A == 0 goto 3 else goto 2 2. INC B; goto 1 3. HALT 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 The Epic's status encodes the current instruction. Automation rules inspect the linked-issue counts and decide the next status. INC and DEC are implemented as issue creation and deletion on the appropriate linked-issue type. Conditional branching is implemented as a JQL-conditioned rule. Implementing Addition Here is a minimal working implementation using one Epic, five linked issues, and one Automation rule per instruction state (Space Settings > Automation). 1. Create Workflow Create a Jira Workflow with statuses initial state BACKLOG, then TODO, DEV and PROD. Any state can transition to any other. Create an Epic in status BACKLOG. 2. Create Rule for TODO DEC A; if A=0 halt, else goto DEV. ...