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.
2 outlets in our directory ran this story, first to last over 16 hours. All of the coverage we found sits in one bucket: centre. That one-sidedness is itself worth noticing.
- ▪ Jira IS Turing-complete — r/programming
Hacker News (Newest) files mainly under programming. We currently carry 5,306 of its stories.
Story provenance
Source · retrieval · rights · ranking — open for full record
inspect →
Story provenance
Attribution is not the same as permission. This drawer separates discovery metadata, excerpts, WeSearch-generated summaries, reuse status, and whether the publisher receives the visit. Nothing here claims a legal grant the publisher has not made.
Record
| Original publisher | Seriot |
| Canonical URL | https://seriot.ch/computation/jira.html |
| Publication time | Fri, 22 May 2026 22:25:19 +0000 |
| Retrieval time | 2026-05-22T22:32:03.042Z |
| Last seen | 2026-05-22T22:32:03.042Z |
| Headline source | Publisher (no WeSearch rewrite) |
| Excerpt source | publisher body |
| Excerpt method | First ~120 words (~800 chars) of extracted publisher body, fair-use limited. |
| Summary | WeSearch · cerebras-chat (WeSearch summarizer) |
| Summary source text | contentText |
| Citation coverage | Summary is a WeSearch-generated derivative; primary citation is the original publisher URL. |
| Cluster | xaG_uKHbXuhC · 2 stories |
| Cluster logic | Grouped by semantic title/content similarity across sources within a rolling window. Same-publisher template collisions are excluded from coverage comparison. |
| Ranking reason | Story pages are not engagement-ranked. Hub feeds use recency, with optional source-diversified chronological ordering (cap consecutive stories per source). No personalized ranking. |
| Publisher visit | Yes — open original |
| Substitutes article? | No — link-out required for full text |
Rights status (four layers)
WeSearch handling by dimension
| Indexing | May the item be indexed (stored, ranked, made findable)? | Allowed |
| Snippet | May a short excerpt of the publisher's text be shown? | Allowed |
| AI summary | May WeSearch generate its own short summary of the article? | Limited |
| Retrieval / RAG | May the content be exposed for third-party retrieval-augmented generation? | Not asserted |
| Model training | May the content be used to train AI models? | Not asserted |
| Commercial reuse | May the content be reused commercially? | Not permitted |
Basis: Derived from the published RSS/Atom feed. Contact: [email protected]. Reviewed: 2026-07-24.
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
