Non-computability of <i>K</i> -theory for computably presented C <sup>*</sup> -algebras

We give an example of a unital C * -algebra A with a computable presentation and for which neither 0 (A) nor 1 (A) has a computable presentation.Proposition 1.1 There is no computable presentation of the group .

Authors

Publication Details

Journal
Canadian Mathematical Bulletin
Published
2026-05-29
DOI
https://doi.org/10.4153/s0008439526102094
Primary Topic
Computability, Logic, AI Algorithms
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Non-computability of K -theory for computably presented C * -algebras

Isaac Goldbring, Christopher J. Eagle, Timothy H. McNicholl, Russell Miller
Canadian Mathematical Bulletin
Computability, Logic, AI Algorithms
article

Non-computability of K -theory for computably presented C * -algebras

Isaac Goldbring, Christopher J. Eagle, Timothy H. McNicholl, Russell Miller
article en

Abstract

We give an example of a unital C * -algebra A with a computable presentation and for which neither 0 (A) nor 1 (A) has a computable presentation.Proposition 1.1 There is no computable presentation of the group .

Canadian Mathematical Bulletin
National Science Foundation, American Institute of Mathematics, City University of New York, Natural Sciences and Engineering Research Council of Canada
Openalex Percentile: Top 4%
Computability, Logic, AI Algorithms
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.