暂无分享,去创建一个
[1] Arno Pauly. Effective local compactness and the hyperspace of located sets , 2019, ArXiv.
[2] Arno Pauly,et al. Tω-representations of compact sets , 2016, ArXiv.
[3] Marian Boylan Pour-el,et al. A computable ordinary differential equation which possesses no computable solution , 1979 .
[4] Pieter Collins,et al. Computable Stochastic Processes , 2014, 1409.4667.
[5] Ulrich Kohlenbach,et al. Applied Proof Theory - Proof Interpretations and their Use in Mathematics , 2008, Springer Monographs in Mathematics.
[6] Klaus Weihrauch,et al. A Tutorial on Computable Analysis , 2008 .
[7] Matthias Schröder,et al. Representing probability measures using probabilistic processes , 2006, J. Complex..
[8] Florian Pausinger,et al. Uniformly distributed sequences in the orthogonal group and on the Grassmannian manifold , 2014, Math. Comput. Simul..
[9] Akitoshi Kawamura,et al. Complexity Theory of (Functions on) Compact Metric Spaces , 2016, 2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).
[10] Anil Nerode,et al. On Extreme Points of Convex Compact Turing Located Set , 1994, LFCS.
[11] Matthias Schröder,et al. Admissible Representations in Computable Analysis , 2006, CiE.
[12] W. Press,et al. Numerical Recipes: The Art of Scientific Computing , 1987 .
[13] K. Weirauch. Computational complexity on computable metric spaces , 2003 .
[14] Martin Ziegler,et al. On the Computational Complexity of Positive Linear Functionals on C[0;1] , 2015, MACIS.
[15] Martín Hötzel Escardó. Algorithmic solution of higher type equations , 2013, J. Log. Comput..
[16] M. Ziegler,et al. Semantics, Logic, and Verification of "Exact Real Computation" , 2016 .
[17] Martin Ziegler,et al. On Formal Verification in Imperative Multivalued Programming over Continuous Data Types , 2016, ArXiv.
[18] Florian Steinberg,et al. Complexity theory for spaces of integrable functions , 2016, Log. Methods Comput. Sci..
[19] Stephen A. Cook,et al. Complexity Theory for Operators in Analysis , 2012, TOCT.
[20] Norbert Th. Müller,et al. The iRRAM: Exact Arithmetic in C++ , 2000, CCA.
[21] Klaus Weihrauch,et al. Representations of measurable sets in computable measure theory , 2014, Log. Methods Comput. Sci..
[22] Ernst Specker,et al. Nicht konstruktiv beweisbare Sätze der Analysis , 1949, Journal of Symbolic Logic.
[23] Arno Pauly,et al. On the topological aspects of the theory of represented spaces , 2012, Comput..
[24] Ker-I Ko,et al. Complexity Theory of Real Functions , 1991, Progress in Theoretical Computer Science.
[25] Klaus Weihrauch,et al. Computability on Computable Metric Spaces , 1993, Theor. Comput. Sci..
[26] Abbas Edalat. A computable approach to measure and integration theory , 2009, Inf. Comput..
[27] S. Galatolo,et al. Dynamics and abstract computability: Computing invariant measures , 2009, 0903.2385.
[28] Willem L. Fouché,et al. How constructive is constructing measures? , 2014, J. Log. Anal..
[29] Martín Hötzel Escardó,et al. Synthetic Topology: of Data Types and Classical Spaces , 2004, DTMPP.