Florida Atlantic University
Many notions of computability allow for an oracle. One natural oracle is the set of algorithms which converge. Normally the way that’s taken is that the programs that are running are different from those in the oracle — the ones running can access an oracle, and the ones in the oracle can’t. But what if the computations running and those in the oracle are the same?
Robert Lubarsky got his PhD in mathematics in 1984 from MIT. He currently holds a position at Florida Atlantic University, and his research interests lie in the areas of constructive mathematics, higher computability theory and set theory.