Abstract
Partial metric spaces generalise metric spaces, allowing non zero self distance. This is needed to model computable partial information, but falls short in an important respect. The present cost of computing information, such as processor time or memory used, is rarely expressible in domain theory, but contemporary theories of algorithms incorporate precise control over cost of computing resources. Complexity theory in Computer Science has dramatically advanced through an intelligent understanding of algorithms over discrete totally defined data structures such as directed graphs, without using partially defined information. So we have an unfortunate longstanding separation of partial metric spaces for modelling partially defined computable information from the complexity theory of algorithms for costing totally defined computable information. To bridge that separation we seek an intelligent theory of cost for partial metric spaces. As examples we consider the cost of computing a double negation ¬¬p in two-valued propositional logic, the cost of computing negation as failure in logic programming, and a cost model for the hiaton time delay.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Ashcroft, E.A., Wadge, W.W.: Lucid, a Nonprocedural Language with Iteration. Comm. ACM 20, 519–526 (1977)
Bukatin, M., Kopperman, R., Matthews, S., Pajoohesh, H.: Partial Metric Spaces. Amer. Math. Monthly 116, 708–718 (2009)
Clark, K.L.: Negation as Failure. In: Gallaire, H., Minker, J. (eds.) Logic and Data Bases, pp. 113–141. Plenum Press, New York (1978)
Fréchet, M.: Sur Quelques Points du Calcul Fonctionnel. Rend. Circ. Mat. Palermo 22, 1–74 (1906)
Matthews, S.G.: Partial Metric Topology. In: Andima, S., et al. (eds.) General Topology and its Applications, Proc. 8th Summer Conf. Queen’s College (1992); Annals of the New York Academy of Science 728, 183–197 (1994)
Matthews, S.G.: An Extensional Treatment of Lazy Data Flow Deadlock. Theor. Comp. Sci. 151, 195–205 (1995)
Sutherland, W.A.: Introduction to Metric and Topological Spaces. Clarendon Press, Oxford (1975)
Tarski, A.: A Lattice-theoretical Fixpoint Theorem and Its Applications. Pacific J. Math. and Appl. 5, 285–309 (1955)
Wadge, W.W.: An Extensional Treatment of Dataflow Deadlock. Theor. Comp. Sci. 13, 3–15 (1981)
Wadge, W.W., Ashcroft, E.A.: Lucid, the Dataflow Programming Language. Academic Press, London (1985)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Matthews, S., Bukatin, M. (2012). An Intelligent Theory of Cost for Partial Metric Spaces. In: Bach, J., Goertzel, B., Iklé, M. (eds) Artificial General Intelligence. AGI 2012. Lecture Notes in Computer Science(), vol 7716. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35506-6_18
Download citation
DOI: https://doi.org/10.1007/978-3-642-35506-6_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-35505-9
Online ISBN: 978-3-642-35506-6
eBook Packages: Computer ScienceComputer Science (R0)