Computability of the Radon-Nikodym Derivative
暂无分享,去创建一个
[1] Klaus Weihrauch,et al. Computability of the Radon-Nikodym Derivative , 2011, CiE.
[2] K. Weihrauch. The Degrees of Discontinuity of some Translators Between Representations of the Real Numbers , 1992 .
[3] Klaus Weihrauch,et al. Turing machines on represented sets, a model of computation for Analysis , 2011, Log. Methods Comput. Sci..
[4] Dudley,et al. Real Analysis and Probability: Integration , 2002 .
[5] Vasco Brattka. Effective Borel measurability and reducibility of functions , 2005, Math. Log. Q..
[6] Klaus Weihrauch,et al. A Tutorial on Computable Analysis , 2008 .
[7] Mathieu Hoyrup,et al. Computability of probability measures and Martin-Löf randomness over metric spaces , 2007, Inf. Comput..
[8] Matthias Schröder,et al. Representing probability measures using probabilistic processes , 2006, J. Complex..
[9] Arno Pauly,et al. Closed choice and a Uniform Low Basis Theorem , 2010, Ann. Pure Appl. Log..
[10] J. K. Hunter,et al. Measure Theory , 2007 .
[11] Christoph Kreitz,et al. Theory of Representations , 1985, Theor. Comput. Sci..
[12] R. Cooke. Real and Complex Analysis , 2011 .
[13] Alberto Marcone,et al. How Incomputable is the Separable Hahn-Banach Theorem? , 2008, CCA.
[14] Klaus Weihrauch,et al. The Computable Multi-Functions on Multi-represented Sets are Closed under Programming , 2008, J. Univers. Comput. Sci..
[15] Matthias Schröder. Admissible representations for probability measures , 2007, Math. Log. Q..
[16] R. C. Bradley. An elementary treatment of the Radon-Nikodym derivative , 1989 .
[17] Vasco Brattka,et al. Towards computability of elliptic boundary value problems in variational formulation , 2006, J. Complex..
[18] Vasco Brattka,et al. Effective Choice and Boundedness Principles in Computable Analysis , 2009, The Bulletin of Symbolic Logic.
[19] K. Weihrauch. The TTE-Interpretation of Three Hierarchies of Omniscience Principles , 1992 .
[20] Klaus Weihrauch,et al. Computable Analysis: An Introduction , 2014, Texts in Theoretical Computer Science. An EATCS Series.
[21] Klaus Weihrauch,et al. A Computable Version of the Daniell-Stone Theorem on Integration and Linear Functionals , 2005, Electron. Notes Theor. Comput. Sci..
[22] Klaus Weihrauch,et al. Elementary Computable Topology , 2009, J. Univers. Comput. Sci..
[23] Stephen G. Simpson,et al. Subsystems of second order arithmetic , 1999, Perspectives in mathematical logic.
[24] H. Bauer,et al. Probability Theory and Elements of Measure Theory , 1982 .
[25] Uwe Mylatz. Vergleich unstetiger Funktionen: principle of omniscience und Vollständigkeit in der C-Hierarchie , 2006 .
[26] Péter Gács,et al. Uniform test of algorithmic randomness over a general space , 2003, Theor. Comput. Sci..
[27] Heinz Bauer,et al. Maß- und Integrationstheorie , 1992 .
[28] Vasco Brattka,et al. Weihrauch degrees, omniscience principles and weak computability , 2009, J. Symb. Log..
[29] Klaus Weihrauch,et al. Computability on the probability measures on the Borel sets of the unit interval , 1997, CCA.
[30] Mathieu Hoyrup,et al. A constructive Borel-Cantelli lemma. Constructing orbits with required statistical properties , 2009, Theor. Comput. Sci..
[31] F. Hagen. Effectivity in Spaces with Admissible Multirepresentations , 2002 .