16 citations · 54 across the 28 of their papers we have counts for
1 paper · 2 filters
Laurent Bienvenu, Noam Greenberg, Benoit Monin
Many constructions in computability theory rely on "time tricks". In the higher setting, relativising to some oracles shows the necessity of these. We construct an oracle~A and a…