scientific article; zbMATH DE number 3271504
From MaRDI portal
zbMath0169.31101MaRDI QIDQ5556429
Publication date: 1968
Full work available at URL: http://www.ams.org/online_bks/mmono21/
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
When does randomness come from randomness?, Approximation to measurable functions and its relation to probabilistic computation, Computability and Noncomputability in Classical Analysis, A blend of methods of recursion theory and topology., Recursive quasi-metric spaces., Computational complexity of real functions, A computable version of the Daniell-Stone theorem on integration and linear functionals, On a finitary version of mathematical analysis, Constructivization of the concepts of \(\varepsilon\) entropy and \(\varepsilon\) capacity, Constructive functionals in spaces of almost-periodic functions, A computable approach to measure and integration theory, Computable invariance, The eigenvalues of an effectively determined self-adjoint operator are computable, but the sequence of eigenvalues is not, On the computability of fractal dimensions and Hausdorff measure, Point-free topological spaces, functions and recursive points; filter foundation for recursive analysis. I, Recursive and nonextendible functions over the reals; filter foundation for recursive analysis. II, Noncomputability in analysis and physics: A complete determination of the class of noncomputable linear operators, Computable Measure Theory and Algorithmic Randomness, Three concepts of decidability for general subsets of uncountable spaces
