University of Cambridge > > Isaac Newton Institute Seminar Series > Studying Introreducibility

Studying Introreducibility

Add to your list(s) 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.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2024, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity