---
title: "An Algebra of Transformers"
source: "arXiv AI/CL/LG（论文）"
source_tier: "t2"
url: "https://arxiv.org/abs/2610.36795v1"
permalink: "https://feed.astralor.com/items/itm_68efa75f2cba3e108216bb07"
published: "2026-10-27T07:59:05.000Z"
score: 53
channel: "ai"
tags: ["Algebra","Transformers","Turing-completeness"]
---

# An Algebra of Transformers

## 速览

On the theoretic analyses on transforms, they mainly focus on the computability analysis, such the Turing-completeness of unbounded precision transformers, the advantage of parallelizability of unbounded precision trans…

## 关键点

- On the theoretic analyses on transforms, they mainly focus on the computability analysis, such the Turing-completeness of unbounded precision transformers, the advantage of parallelizability of unbounded precision trans…
- This paper give transformers an algebra for reasoning, which relies heavily on the functional decomposition results of transformers.
- This algebra uses functional decompositions as atomic actions, includes sequential composition and parallel composition, recursion for feedback and abstraction for hidden layers.

## 全文

On the theoretic analyses on transforms, they mainly focus on the computability analysis, such the Turing-completeness of unbounded precision transformers, the advantage of parallelizability of unbounded precision transformers and the limitations of bounded precision transformers. This paper give transformers an algebra for reasoning, which relies heavily on the functional decomposition results of transformers. This algebra uses functional decompositions as atomic actions, includes sequential composition and parallel composition, recursion for feedback and abstraction for hidden layers. As we know, it is the first attempt to model transformers logically and can be used to verify the correctness of transformer based applications.

---

引用前请核对原文;本文由星际流动整理:https://feed.astralor.com/items/itm_68efa75f2cba3e108216bb07