Computer Science – Computational Complexity
Scientific paper
2010-06-02
EPTCS 24, 2010, pp. 160-166
Computer Science
Computational Complexity
Scientific paper
10.4204/EPTCS.24.20
In a recent paper, two multi-representations for the measurable sets in a
computable measure space have been introduced, which prove to be topologically
complete w.r.t. certain topological properties. In this contribution, we show
them recursively complete w.r.t. computability of measure and set-theoretical
operations.
No associations
LandOfFree
Complete Multi-Representations of Sets in a Computable Measure Space 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 Complete Multi-Representations of Sets in a Computable Measure Space, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Complete Multi-Representations of Sets in a Computable Measure Space will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-512965