2 citations · 7 across the 12 of their papers we have counts for
3 papers · 1 filter
Computing sets from all infinite subsets
Noam Greenberg, Matthew Harrison-Trainor, Ludovic Patey +1
A set is introreducible if it can be computed by every infinite subset of itself. Such a set can be thought of as coding information very robustly. We investigate introreducible se…
Computable classifications of continuous, transducer, and regular functions
Johanna N. Y. Franklin, Rupert Hölzl, Alexander Melnikov +2
We develop a systematic algorithmic framework that unites global and local classification problems using index sets. We prove that the classification problem for continuous (binary…
Realizing Computably Enumerable Degrees in Separating Classes
Peter Cholak, Rod Downey, Noam Greenberg +1
We investigate what collections of c.e.\ Turing degrees can be realised as the collection of elements of a separating class of c.e.\ degree. We show that for every c.e.\ de…