Upper bound by Kolmogorov complexity for the probability in computable POVM measurement
Kohtaro TadakiPublished in: CoRR (2002)
Keyphrases
- kolmogorov complexity
- upper bound
- lower bound
- inductive inference
- error probability
- branch and bound algorithm
- complexity measures
- lower and upper bounds
- probability distribution
- worst case
- artificial neural networks
- vc dimension
- sample complexity
- generalization error
- distance function
- branch and bound
- data mining
- np hard
- expert systems
- learning algorithm
- machine learning