Effective Capacity and Randomness of Closed Sets
We investigate the connection between measure and capacity for the space of nonempty closed subsets of {0,1}*. For any computable measure, a computable capacity T may be defined by letting T(Q) be the measure of the family of closed sets which have nonempty intersection with Q. We prove an effective...
Main Authors: | Douglas Cenzer, Paul Brodhead |
---|---|
Format: | Article |
Language: | English |
Published: |
Open Publishing Association
2010-06-01
|
Series: | Electronic Proceedings in Theoretical Computer Science |
Online Access: | http://arxiv.org/pdf/1006.0397v1 |
Similar Items
-
Algorithmic Randomness and Capacity of Closed Sets
by: Douglas Cenzer, et al.
Published: (2011-09-01) -
Sub-computable Boundedness Randomness
by: Sam Buss, et al.
Published: (2014-12-01) -
On fuzzy strongly g* - closed sets and g** - closed sets
by: Hamid Reza Morad, et al.
Published: (2015-06-01) -
THE SET OF QUANTUM CORRELATIONS IS NOT CLOSED
by: WILLIAM SLOFSTRA
Published: (2019-01-01) -
Compactly f- closed and compactly f-k-closed sets
by: Habeeb Kareem Abdullah, et al.
Published: (2013-12-01)