May 24, 2026
Bug tracker or supervillain?
Jira Is Turing-Complete
Turns out the office task app can act like a computer, and the comments are losing it
TLDR: A developer showed that Jira’s automation system can be pushed so far it can mimic a real computer, using tickets and status changes to do math. Commenters were split between "well, obviously" and "this explains why Jira feels like an unstoppable office nightmare."
A programmer just did the most gloriously cursed thing imaginable: he showed that Jira, the corporate task-tracking app many workers already fear on sight, can be made to behave like a full-blown computer. Not by writing a normal program, but by using status changes, linked tickets, and automation rules to make Jira "count" and move through steps. In plain English: yes, your bug tracker can now do math, and yes, that sounds like the setup to a workplace horror story.
The real fireworks, though, exploded in the reactions. One camp shrugged and said this was basically inevitable: workflow tools are supposed to automate processes, so of course they can be bent into doing anything. The other camp responded with the energy of people who have been personally victimized by enterprise software. "That explains why it’s impossible to tell whether any given Jira operation is going to halt or not," one commenter joked, turning a deep computer science idea into a painfully relatable office meme. Another called Jira "completely awful" and declared that this very awfulness gives it unlimited power to become even worse.
The harshest burn? Veterans of Jira automation said the proof is impressive, but using the tool feels like programming in assembly, which is nerd-speak for "needlessly painful." And then came the hacker-brain twist: if Jira is this programmable, why aren’t more office coders secretly taming it with scripts and flipping the power balance? In other words, the article proved a point about computation — but the comments turned it into a referendum on whether Jira is a tool, a monster, or both.
Key Points
- •The article presents an explicit reduction from a Minsky register machine to Jira Automation to argue that Jira is Turing-complete.
- •It maps machine registers to counts of linked Jira issue types, the program counter to an Epic’s status, and instructions to automation rules.
- •A working addition example is implemented with one Epic, linked Bug and Task issues, and rules that perform decrement, increment, branching, and halting.
- •The addition setup starts with A=2 and B=3 and finishes with 0 Bugs and 5 Tasks, demonstrating computation of 2 + 3 = 5.
- •A second example uses Convert Issue Type to build a two-state Fibonacci machine with three registers, limited in practice by Jira Cloud’s automation chain-depth cap.