Jira Is Turing-Complete
Scored daily by a customisable AI persona to surface the most relevant engineering leadership news.
Proves Jira is Turing-complete, clever and relevant to developer experience.
A formal proof demonstrates Jira's automation language is Turing-complete by implementing a Minsky register machine using Epics, linked issues, and workflow transitions. The construction uses issue creation/deletion for INC/DEC operations and JQL-conditioned rules for conditional branching, with a working addition machine that adds 2+3=5. A Fibonacci sequence machine further shows practical computation, though it hits Jira Cloud's 10-trigger chain-depth cap requiring manual re-triggering.
Treat Jira automation rules as a finite-state programming language with bounded execution depth, and design workflows to handle chain-depth limits through manual or scheduled re-triggering.
For platform engineers building complex workflows, this proves Jira automations are computationally equivalent to general-purpose programs, meaning any algorithmic logic can theoretically be encoded—but practical limits like chain-depth caps and rule execution timeouts impose real constraints that must be architected around.
Building a Minsky Machine in Atlassian Automation22nd May 2026 Engineering folkloreholdsthatJira(Atlassian's project-tracking tool) isTuring-complete. Existing claims point vaguely at automation features without exhibiting a reduction. This article supplies a proof, with setup instructions and execution trace. AMinsky register machineneeds only two unbounded counters and a finite set of labeled instructions: A Minsky program that adds register A into register B looks like: Minskyproved this model Turing-complete (1967).