Abstract
While computability theory on many countable sets is well established and for computability on the real numbers several (mutually non-equivalent) definitions are applied, for most other uncountable sets, in particular for measures, no generally accepted computability concepts at all ha,ve been available until now. In this contribution we introduce computability on the set M of probability measures on the Borel subsets of the unit interval [0; 1]. Its main purpose is to demonstrate that this concept of computability is not merely an ad hoc definition but has very natural properties. Although the definitions and many results can of course be transferred to more general spaces of measures, we restrict our attention to M in order to keep the technical details simple and concentrate on the central ideas. In particular, we show that simple obvious reqirements exclude a number of similar definitions, that the definition leads to the expected computability results, that there are other natural definitions inducing the same computability theory and that the theory is embedded smoothly into classical measure theory. As background we consider TTE, Type 2 Theory of Effectivity [KW84, KW85], which provides a frame for very realistic computability definitions. In this approach, computability is defined on finite and infinite sequences of symbols explicitly by Turing machines and on other sets by means of notations and representations. Canonical representations are derived from information structures [Wei97]. We introduce a standard representation \(\delta _m : \subseteq \sum ^\omega \to M\)via some natural information structure defined by a subbase σ (the atomic properties) of some topology τ on M and a standard notation of σ. While several modifications of δ m suggesting themselves at first glance, violate simple and obvious requirements, δ m has several very natural properties and hence should induce an important computability theory. Many interesting functions on measures turn out to be computable, in particular linear combination, integration of continuous functions and any transformation defined by a computable iterated function system with probabilities. Some other natural representations of M are introduced, among them a Cauchy representation associated with the Hutchinson metric, and proved to be equivalent to δ m . As a corollary, the final topology τ of δ m is the well known weak topology on M.
Preview
Unable to display preview. Download preview PDF.
References
M.F. Barnsley. Fractals everywhere. Academic Press, Boston, 1993.
Heinz Bauer. Wahrscheinlichkeitstheorie und Grundzüge der Maβtheorie. de Gruyter, Berlin, 1974.
Errett Bishop und Douglas S. Bridges. Constructive Analysis, Band 279 der Reihe Grundlehren der mathematischen Wissenschaft. Springer, Berlin, 1985.
Abbas Edalat. Domain theory and integration. Theoretical Computer Science, 151:163–193, 1995.
Abbas Edalat. Power domains and iterated function systems. Information and Computation, 124(2):182–197, 1996.
J. Hutchinson. Fractals and self-similarity. Indiana University Journal of Mathematics, 30:713–747, 1981.
Ker-I Ko. Complexity Theory of Real Functions. Progress in Theoretical Computer Science. Birkhäuser, Boston, 1991.
Boris Abramovich Kushner. Lectures on Constructive Mathematical Analysis, Band 60 der Reihe Translation of Mathematical Monographs. American Mathematical Society, Providence, 1985.
Christoph Kreitz und Klaus Weihrauch. A unified approach to constructive and recursive analysis. In M.M. Richter, E. Borger, W. Oberschelp, B. Schinzel und W. Thomas, Hrsg., Computation and Proof Theory, Band 1104 der Reihe Lecture Notes in Mathematics, Seiten 259–278, Berlin, 1984. Springer. Proceedings of the Logic Colloquium, Aachen, July 18–23, 1983, Part II.
Cristoph Kreitz und Klaus Weihrauch. Theory of representations. Theoretical Computer Science, 38:35–53, 1985.
Angelika Reiser und Klaus Weihrauch. Natural numberings and generalized computability. Elektronische Informationsverarbeitung und Kybernetik, 16:11–20, 1980.
Joseph F. Traub, G.W. Wasilkowski und H. Woźniakowski. Information-Based Complexity. Computer Science and Scientific Computing. Academic Press, New York, 1988.
Klaus Weihrauch. Computability, Band 9 der Reihe EATCS Monographs on Theoretical Computer Science. Springer, Berlin, 1987.
Klaus Weihrauch. Computability on computable metric spaces. Theoretical Computer Science, 113:191–210, 1993. Fundamental Study.
Klaus Weihrauch. A foundation of computable analysis. Bulletin of the European Association for Theoretical Computer Science, 57:167–182, Oktober 1995. The Structural Complexity Column by Juris Hartmanis.
Klaus Weihrauch. A Foundation for Computable Analysis. In Douglas S. Bridges, Cristian S. Calude, Jeremy Gibbons, Steve Reeves und Ian H. Witten, Hrsg., Combinatorics, Complexity, and Logic, Discrete Mathematics and Theoretical Computer Science, Seiten 66–89, Singapore, 1997. Springer. Proceedings of DMTCS'96.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Weihrauch, K. (1997). Computability on the probability measures on the Borel sets of the unit interval. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds) Automata, Languages and Programming. ICALP 1997. Lecture Notes in Computer Science, vol 1256. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63165-8_174
Download citation
DOI: https://doi.org/10.1007/3-540-63165-8_174
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63165-1
Online ISBN: 978-3-540-69194-5
eBook Packages: Springer Book Archive