Jira [Automation] is Turing-Complete

[#1]

As somebody who dropped-out of college, as well failing the one class in C I took (and barely passing Pascal?), I don't quite understand what "Turing Complete" means, but I can 100% attest to the conclusion that:

So, if complex Jira automations feel like programs, it is because they literally are.

Anyways, this is not a full article, but it's definitely not a Question, so I'm putting it here for folks like @Bill Sheboy to enjoy:

Jira is Turing-Complete

Building a Minsky Machine in Atlassian Automation
22nd 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.

Some useful terminology for me (from the abstract's link):

A programming language is said to be Turing-complete if every Turing machine has at least one corresponding program in the language which implements or simulates that machine.

Also from esolangs.org (which is a fun site!):

A Minsky machine is a finite-state automaton with access to a number of unbounded registers or counters. These registers can be thought of as monosymbolic stacks (i.e. stacks of all the same symbol.)

Which... sadly still does not help me.

BUT, doing some Googling, I found that while at Bell Labs, Marvin Minsky came up with the idea for the "ultimate machine" (aka the "useless machine"), and Claude Shannon built one. I love love love these things. (I really should get around to building my own sometime...)

Source: YouTube: The Ultimate Machine - Claude Shannon 

---

Sidenote: Despite not knowing anything about Claude Shannon, several years ago I persuaded my wife and oldest kid to attend a screening of The Bit Player at Mountain View, CA's Computer History Museum. It was a fun watch! (They dramatize a lot of his life.)

In a blockbuster paper in 1948, Claude Shannon introduced the notion of a "bit" and laid the foundation for the information age.

Alas, the film is not streaming for free anywhere (It can be rented/"bought" from Amazon Prime), but here's the trailer and a few Q&As from other screenings:

YouTube: IEEE ITS - The Bit Player - Claude Shannon documentary film 

Anyways, yeah, that's enough of a rabbit hole for today. Enjoy!

[Darryl Lee]

Oh, so here's the Automation Rules:

He then starts talking about Fibonacci (where I am thoroughly lost) and includes some interesting bits here about Jira Cloud's limits vs Data Center properties around Automation timeouts:

Unlike the addition machine, the Fibonacci machine has no halt state. It runs until Jira Cloud's chain-depth cap of 10 triggers, at which point the operator re-triggers the Epic to continue. A single status edit restarts the cascade.

The reduction still holds, the human just supplies the next clock tick. Jira Data Center exposes the same as automation.rule.execution.timeout and related, configurable properties.

[Darryl Lee]

Hilariously, I followed the "folklore holds" link to this Hacker News thread:

Jira is Turing-complete. 

Where someone replied:

Can't read this thread without remembering the following nugget:
https://x.com/HackerNewsOnion/status/981609242221318145?s=19

AND I LOLed:

And this comment there reminded me that @Eugene Sokhransky from YouTrack (JetBrains) was at 

@Andy _ Fun Inc 's Not A Party during Atlassian's Team 26 in Anaheim last month!