2012/06/07 by Adam R. Day, Day, Adam R., Joseph S. Miller +1 · 1 citation
Computer Science · Mathematics · #Computability, Logic, AI Algorithms #semigroups and automata theory #Benford’s Law and Fraud Detection
paper · pdf · doi:10.48550/arxiv.1206.1603
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čera, who introduced both cuppability notions.