Abstract
Abstract
We initiate the study of computable presentations of real and complex C*-algebras under the program of effective metric structure theory. With the group situation as a model, we develop corresponding notions of recursive presentations and word problems for C*-algebras, and show some analogous results hold in this setting. Famously, every finitely generated group with a computable presentation is computably categorical, but we provide a counterexample in the case of C*-algebras. On the other hand, we show every finite-dimensional C*-algebra is computably categorical.
Publisher
Cambridge University Press (CUP)
Reference45 articles.
1. The word problem and residually finite groups;Dyson;Notices of the American Mathematical Society,1964
2. C*-Algebras by Example
3. On the algorithmic unsolvability of the word problem in group theory;Novikov;Trudy Matematicheskogo Instituta imeni V. A. Steklova,1955
4. Shape theory for $C^*$-algebras.