Nicolas Seriot has supplied the first rigorous proof that Jira is Turing-complete, putting engineering folklore on solid ground. The proof implements a Minsky register machine inside Atlassian's automation features, using linked-issue counts as registers and Epic statuses as instruction pointers.

The reduction maps cleanly: two issue types serve as counters, automation rules form the dispatch table, and INC/DEC operations become issue creation or deletion. A working addition machine computed 2 + 3 = 5 across five transitions on a real Atlassian instance, with setup instructions included in the article.

Seriot also built a three-state Fibonacci generator that runs until Jira Cloud's chain-depth cap of 10 halts execution. Jira Data Center offers configurable timeouts for longer runs. Under the standard convention that every physical computer is finite, the automation language meets the Turing-completeness threshold. If your Jira workflows feel like programs, that is because they literally are.