A computational model for metric spaces
نویسندگان
چکیده
منابع مشابه
A Computational Model for Metric Spaces
For every metric space X, we deene a continuous poset BX such that X is home-omorphic to the set of maximal elements of BX with the relative Scott topology. The poset BX is a dcpo ii X is complete, and !-continuous ii X is separable. The computational model BX is used to give domain-theoretic proofs of Banach's xed point theorem and of two classical results of Hutchinson: on a complete metric s...
متن کاملComputational Complexity on Computable Metric Spaces
We introduce a new Turing machine based concept of time complexity for functions on computable metric spaces. It generalizes the ordinary complexity of word functions and the complexity of real functions studied by Ko [19] et al. Although this definition of TIME as the maximum of a generally infinite family of numbers looks straightforward, at first glance, examples for which this maximum exist...
متن کاملOn a Metric on Translation Invariant Spaces
In this paper we de ne a metric on the collection of all translation invarinat spaces on a locally compact abelian group and we study some properties of the metric space.
متن کاملA Model Existence Theorem for Infinitary Formulas in Metric Spaces
We prove a Model Existence Theorem for a fully infinitary logic LA for metric structures. This result is based on a generalization of the notions of approximate formulas and approximate truth in normed structures introduced by Henson ([7]) and studied in different forms by Anderson ([1]) and Fajardo and Keisler ([2]). This theorem extends Henson’s Compactness Theorem for approximate truth in no...
متن کاملOn metric spaces induced by fuzzy metric spaces
For a class of fuzzy metric spaces (in the sense of George and Veeramani) with an H-type t-norm, we present a method to construct a metric on a fuzzy metric space. The induced metric space shares many important properties with the given fuzzy metric space. Specifically, they generate the same topology, and have the same completeness. Our results can give the constructive proofs to some probl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1998
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(96)00243-5