Jira Is Turing-Complete

Nicolas Seriot demonstrates that Atlassian's Jira project-tracking tool is Turing-complete by implementing a Minsky register machine—a theoretical computing model with two counters and conditional branching—using Jira's automation features. The proof maps Jira's linked-issue counts to registers, workflow statuses to program counters, and automation rules to instructions, with a working example that adds 2+3=5 by transitioning an Epic through states while creating and deleting linked issues. This establishes a formal reduction showing Jira's automation language can theoretically compute any computable function.