2 citations · 2 across the 3 of their papers we have counts for
5 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…
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…
Coding in the automorphism group of a computably categorical structure
Dan Turetsky
Using new techniques for controlling the categoricity spectrum of a structure, we construct a structure with degree of categoricity but infinite spectral dimension, answering a que…
Relationships between computability-theoretic properties of problems
Rod Downey, Noam Greenberg, Matthew Harrison-Trainor +2
A problem is a multivalued function from a set of \emph{instances} to a set of \emph{solutions}. We consider only instances and solutions coded by sets of integers. A problem admit…
Finding bases of uncountable free abelian groups is usually difficult
Noam Greenberg, Dan Turetsky, Linda Brown Westrick
We investigate effective properties of uncountable free abelian groups. We show that identifying free abelian groups and constructing bases for such groups is often computationally…