加载中…
We introduce the notion of a computably strongly self-absorbing C*-algebra and show that the following C*-algebras are computably strongly self-absorbing: the Cuntz algebras and , the UHF algebra and the tensor product , where is a supernatural number of infinite type with computably enumerable support, and the Jiang-Su algebra . In connection with the last example, we show that has a computable presentation. The results above are a special instance of a computable version of the standard approximate intertwining argument due to Elliott.

生成讲解博客的中文版本

生成AI智能校验的中文版本