Jira is Turing-Complete: Building a Minsky Machine in Atlassian Automation
Summary
The article demonstrates that Jira's no-code automation language can encode a two-counter machine (a Minsky machine) and thus is Turing-complete. It maps registers to Jira concepts (Bug, Task, Epic) and provides a minimal addition and a Fibonacci-like machine to illustrate the idea, while noting practical limits such as chain-depth caps. This offers a compelling angle for content on the power and limits of no-code automation tools.