Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

19

TCS
1998

favoriteEmaildiscussreport

72views Theoretical Computer Science» more TCS 1998»

A Computational Model for Metric Spaces

13 years 10 months ago

A Computational Model for Metric Spaces

Download www.mathem.pub.ro

In this paper we present an alternative order-theoretic proof of the Banach ﬁxed point theorem for selfmaps on complete metric spaces which is based on formal balls and, contrary to the case of Edalat and Heckmann [Theoret. Comput. Sci. 193 (1998), 53-73], does not derive from the well-known dcpo ﬁxed point theorem. M.S.C. 2000: 06A06, 54E35, 54H25, 54E50, 68Q55. Key words: metric, ordered set, dcpo, formal ball, computational model.

Abbas Edalat, Reinhold Heckmann

Real-time Traffic

Alternative Order-theoretic Proof | Formal Ball | Point Theorem | TCS 1998 | Theoretical Computer Science |

claim paper

Related Content

» On Continuous Models of Computation Towards Computing the Distance Between Logic Programs

» A Network Model of Analogue Computation over Metric Algebras

» A Cost Model for Similarity Queries in Metric Spaces

» Metric Structures and Probabilistic Computation

» A Metric on the Space of Reduced Phylogenetic Networks

» Unfairness Metrics for SpaceSharing Parallel Job Schedulers

» A New Geometric Metric in the Space of Curves and Applications to Tracking Deforming Objec...

» Using the kNearest Neighbor Graph for Proximity Searching in Metric Spaces

» Some Results on Greedy Embeddings in Metric Spaces

Post Info
More Details (n/a)

Added	23 Dec 2010
Updated	23 Dec 2010
Type	Journal
Year	1998
Where	TCS
Authors	Abbas Edalat, Reinhold Heckmann

Comments (0)