Cupping with random sets
Cupping with random sets
We prove that a set is K-trivial if and only if it is not weakly ML-cuppable. Further, we show that a set below zero jump is K-trivial if and only if it is not ML-cuppable. These results settle a question of Ku\v{c}era, who introduced both cuppability notions.
Joseph S. Miller、Adam R. Day
数学
Joseph S. Miller,Adam R. Day.Cupping with random sets[EB/OL].(2012-06-07)[2025-08-23].https://arxiv.org/abs/1206.1603.点此复制
评论