8 citations · 29 across the 22 of their papers we have counts for
30 papers
The computable functional calculus
Christopher J. Eagle, Timothy H. McNicholl
We show that the continuous functional calculus is computable. As consequences we obtain the computable compactness of the spectrum of any computable normal element of a computably…
Computable -theory for C*-algebras II: AF algebras
Christopher J. Eagle, Isaac Goldbring, Timothy H. McNicholl
We continue the study of the effective content of -theory for C*-algebras, with a focus on AF algebras. We show that from a c.e. presentation of an AF algebra it is possible to…
Non-computability of -theory for computably presented C*-algebras
Christopher J. Eagle, Isaac Goldbring, Timothy H. McNicholl +1
We give an example of a unital C*-algebra with a computable presentation and for which neither nor has a computable presentation.
Computable -theory for -algebras: UHF algebras
Christopher Eagle, Isaac Goldbring, Timothy McNicholl +1
We initiate the study of the effective content of -theory for -algebras. We prove that there are computable functors which associate, to a computably enumerable pr…
Evaluative presentations
Timothy H. McNicholl
We study presentations of that are evaluative over a presentation of in that is computable. We prove existence-uniqueness theorems for such presen…
Computable Gelfand Duality
Peter Burton, Christopher J. Eagle, Alec Fox +5
We establish a computable version of Gelfand Duality. Under this computable duality, computably compact presentations of metrizable spaces uniformly effectively correspond to compu…