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.
A Minsky register machine needs only two unbounded counters and a finite set of labeled instructions:
A Minsky program that adds register A into register B looks like:
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:
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 .