Studying Introreducibility
About this item
| Description: |
Daniel Turetsky (Victoria University of Wellington)
08/06/2022 Programme: SASW09 SemId: 36173 |
|---|
| Created: | 2022-06-09 19:59 |
|---|---|
| Collection: | International conference on computability, complexity and randomness |
| Publisher: | Daniel Turetsky |
| Copyright: | Isaac Newton Institute |
| Language: | eng (English) |
| Abstract: | 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. |
|---|---|