Computability on computable metric spaces
Theoretical Computer Science
Computability on subsets of Euclidean space I: closed and compact subsets
Theoretical Computer Science - Special issue on computability and complexity in analysis
Effective properties of sets and functions in metric spaces with computability structure
Theoretical Computer Science - Special issue on computability and complexity in analysis
Computable analysis: an introduction
Computable analysis: an introduction
Computability on subsets of metric spaces
Theoretical Computer Science - Topology in computer science
Hi-index | 0.00 |
We show that if a computable sequence of real-valued functions on an effectively compact metric space converges pointwise monotonically to a computable function, then the sequence converges effectively uniformly to the function. This is an effectivized version of Dini's Theorem.