University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Studying Introreducibility

  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

Studying Introreducibility

Download to your calendar using vCal

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

SASW09 - International conference on computability, complexity and randomness

A set is introreducible if it can be computed from each of its infinite subsets.  We investigate this notion, defining several natural generalizations and reducibilities.  This is joint work Noam Greenberg, Matthew Harrison-Trainor and Ludovic Patey.

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

Garden Room, St Edmunds College eng-cv-seminars@lists.cam.ac.uk Hybrid & Department of Chemistry (Pfizer lecture theatre)

Other talks

Title to be confirmed CONFERENCE: Chemical and material sciences enabled by AI and automation Harnessing Radical Reactivity for Molecular Innovation Using A Function-Centric Lens to Re-consider Regularisation, Representation Transfer and Geometric Properties of Neural Networks Title to be confirmed Talk title TBC
 

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