Computable Gelfand Duality
Abstract: We establish a computable version of Gelfand Duality. Under this computable duality, computably compact presentations of metrizable spaces uniformly effectively correspond to computable presentations of unital commutative $C*$ algebras.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.