Jira Is Turing Complete

7 hours ago

A Minsky register machine, which is Turing-complete, can be implemented in Atlassian Jira using automation rules.
Registers are represented by linked issues (e.g., Bug for register A, Task for register B), and the program counter is the status of an Epic.
INC and DEC operations are mapped to creating or deleting linked issues, with branching handled via JQL-conditioned rules.
A proof-of-concept addition machine was demonstrated, adding 2 + 3 = 5 via automated status transitions in a real Jira instance.
Jira's automation language supports operations like CONVERT (changing issue types), simplifying complex programs like Fibonacci sequence generation without extending computational power.
Finite resources in Jira Cloud (e.g., chain-depth caps) don't negate Turing-completeness under standard conventions, as human intervention can provide additional clock ticks.
Jira Data Center offers configurable properties for rule execution, supporting the same computational model.
The article concludes that Jira automations are literal programs, reinforcing its Turing-completeness.

Hasty Briefsbeta