2 research outputs found

    Computable Stone spaces

    Full text link
    We investigate computable metrizability of Polish spaces up to homeomorphism. In this paper we focus on Stone spaces. We use Stone duality to construct the first known example of a computable topological Polish space not homeomorphic to any computably metrized space. In fact, in our proof we construct a right-c.e. metrized Stone space which is not homeomorphic to any computably metrized space. Then we introduce a new notion of effective categoricity for effectively compact spaces and prove that effectively categorical Stone spaces are exactly the duals of computably categorical Boolean algebras. Finally, we prove that, for a Stone space XX, the Banach space C(X;R)C(X;\mathbb{R}) has a computable presentation if, and only if, XX is homeomorphic to a computably metrized space. This gives an unexpected positive partial answer to a question recently posed by McNicholl.Comment: 16 page

    Computable classifications of continuous, transducer, and regular functions

    Full text link
    We develop a systematic algorithmic framework that unites global and local classification problems for functional separable spaces and apply it to attack classification problems concerning the Banach space C[0,1] of real-valued continuous functions on the unit interval. We prove that the classification problem for continuous (binary) regular functions among almost everywhere linear, pointwise linear-time Lipshitz functions is Σ20\Sigma^0_2-complete. We show that a function f ⁣:[0,1]Rf\colon [0,1] \rightarrow \mathbb{R} is (binary) transducer if and only if it is continuous regular; interestingly, this peculiar and nontrivial fact was overlooked by experts in automata theory. As one of many consequences, our Σ20\Sigma^0_2-completeness result covers the class of transducer functions as well. Finally, we show that the Banach space C[0,1]C[0,1] of real-valued continuous functions admits an arithmetical classification among separable Banach spaces. Our proofs combine methods of abstract computability theory, automata theory, and functional analysis.Comment: Revised argument in Section 5; results unchange
    corecore