From automata to operator algebras: possible, impossible, and open

The question whether the language of automata can pass to the C*-algebras and Hilbert spaces of physics conflates a mathematical claim with a physical one, and the two have opposite answers. We separate them and classify. Mathematically the passage is canonical: every finite deterministic automaton carries a unitary core, a permutation on its eventual image with the roots of unity of its cycles as spectrum, and a nilpotent transient; each cycle generates a full matrix algebra through the finite Weyl pair; the dissipative remainder is carried by dilation and, for infinite automata, by Cuntz-type algebras; and for the binary alphabet O_2 acts by the parent-to-children maps of the binary tree, generating exactly the Walsh system, with bit reversal exchanging its two one-sided generator families. Physically the passage is obstructed for finite or local deterministic substrates by five theorems (Bell, Kochen--Specker, Pusey--Barrett--Rudolph, Hardy, Montina), each stated with its assumptions and the price of its exit. The positivity problem is not among the theorems, and we isolate its finite commuting case: the principal-branch generator of a product of cycles is not a sum of generators of the factors, whatever branches are chosen for them, while the additive generator is positive and exact, so that the problem proper concerns non-commuting local pieces and remains open. Between the two answers we re-derive Wetterich's automaton--fermion bridge at small size: it stands on built-in structure, and in its one-particle sector the noncommuting operators are the clock-and-shift pair. The region of nonlinear non-Clifford constructions remains open, and the automaton of the companion paper is placed in it exactly: lifted to qubits, its cell rule is affine for four of its sixteen forms, its word rotations are Clifford on a few low bits only, and its word contractions, the mechanism of its frozen phase, are not permutations and lift only by dilation. Every computational claim regenerates from a verification script.

Authors

Institutions

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-21
DOI
https://doi.org/10.5281/zenodo.24419099
Primary Topic
Advanced Operator Algebra Research
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

From automata to operator algebras: possible, impossible, and open

Plamen Stoychev
Zenodo (CERN European Organization for Nuclear Research)
Advanced Operator Algebra Research
preprint

From automata to operator algebras: possible, impossible, and open

Plamen Stoychev
preprint en

Abstract

The question whether the language of automata can pass to the C*-algebras and Hilbert spaces of physics conflates a mathematical claim with a physical one, and the two have opposite answers. We separate them and classify. Mathematically the passage is canonical: every finite deterministic automaton carries a unitary core, a permutation on its eventual image with the roots of unity of its cycles as spectrum, and a nilpotent transient; each cycle generates a full matrix algebra through the finite Weyl pair; the dissipative remainder is carried by dilation and, for infinite automata, by Cuntz-type algebras; and for the binary alphabet O_2 acts by the parent-to-children maps of the binary tree, generating exactly the Walsh system, with bit reversal exchanging its two one-sided generator families. Physically the passage is obstructed for finite or local deterministic substrates by five theorems (Bell, Kochen--Specker, Pusey--Barrett--Rudolph, Hardy, Montina), each stated with its assumptions and the price of its exit. The positivity problem is not among the theorems, and we isolate its finite commuting case: the principal-branch generator of a product of cycles is not a sum of generators of the factors, whatever branches are chosen for them, while the additive generator is positive and exact, so that the problem proper concerns non-commuting local pieces and remains open. Between the two answers we re-derive Wetterich's automaton--fermion bridge at small size: it stands on built-in structure, and in its one-particle sector the noncommuting operators are the clock-and-shift pair. The region of nonlinear non-Clifford constructions remains open, and the automaton of the companion paper is placed in it exactly: lifted to qubits, its cell rule is affine for four of its sixteen forms, its word rotations are Clifford on a few low bits only, and its word contractions, the mechanism of its frozen phase, are not permutations and lift only by dilation. Every computational claim regenerates from a verification script.

Zenodo (CERN European Organization for Nuclear Research)
Information Physics Institute (GB)
Advanced Operator Algebra Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon
From automata to operator algebras: possible, impossible, and open — Plamen Stoychev · Zenodo (CERN European Organization for Nuclear Research) (2026) | TGRS Research Map | TGRS