Jira Is Turing-Complete
The article discusses the Turing-completeness of Jira, a project-tracking tool by Atlassian. It provides a proof by demonstrating how Jira's automation features can be mapped to a Minsky register machine. The author outlines the implementation of basic arithmetic operations, such as addition and Fibonacci sequence generation, using Jira's automation rules.
- ▪Jira's automation language can be used to implement a Minsky register machine, proving its Turing-completeness.
- ▪The article details how to set up a workflow in Jira to perform addition and Fibonacci calculations using linked issues.
- ▪Jira's automation features allow for complex programming constructs, despite its finite quotas.
Opening excerpt (first ~120 words) tap to expand
Nicolas Seriot Computation > Jira is Turing-Complete Jira is Turing-Complete Building a Minsky Machine in Atlassian Automation 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.
…
Excerpt limited to ~120 words for fair-use compliance. The full article is at Seriot.
Discussion
0 commentsMore from Seriot
