University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Cupping with random sets

  Browse A-Z

Log in

University Account External (via Google)

πŸ” Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

Cupping with random sets

Download to your calendar using vCal

If you have a question about this talk, please contact Mustapha Amrani .

Semantics and Syntax: A Legacy of Alan Turing

A set $X$ is ML-cuppable if there exists an incomplete Martin-Löf random $R$ that joins $X$ to zero jump. It is weakly ML-cuppable if there exists an incomplete Martin-Löf random $R$ that joins $X$ above zero jump. 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. This is joint work with Joseph S. Miller.

This talk is part of the Isaac Newton Institute Seminar Series series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Number Theory Study Group: P-adic Analysis https://zoom.us/j/92978790636?pwd=ZVdHWTVmQkVuZmtHNlBqVjlFUXMyZz09 Meeting ID: 929 7879 0636 Passcode: 091606 Madingley Conversations

Other talks

Title TBC Teams Announced Zooming in on the assembly of galaxies in the early Universe Title TBC In conversation: Louis Herns Marcelin and Ola Osman on legacies of enslavement and contemporary violence in Liberia and Haiti Director's Welcome
 

Β© 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity