Computer Science – Logic in Computer Science
Scientific paper
2008-06-19
Computer Science
Logic in Computer Science
This paper is to be part of the proceedings of the Symbolic Computation in Software Science Austrian-Japanese Workshop (SCSS 2
Scientific paper
Compact sets in constructive mathematics capture our intuition of what computable subsets of the plane (or any other complete metric space) ought to be. A good representation of compact sets provides an efficient means of creating and displaying images with a computer. In this paper, I build upon existing work about complete metric spaces to define compact sets as the completion of the space of finite sets under the Hausdorff metric. This definition allowed me to quickly develop a computer verified theory of compact sets. I applied this theory to compute provably correct plots of uniformly continuous functions.
No associations
LandOfFree
A Computer Verified Theory of Compact Sets does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A Computer Verified Theory of Compact Sets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Computer Verified Theory of Compact Sets will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-563307