Uncountably many isomorphic copies of a computable relation, International Workshop on Recursion Theory and Complexity Theory, Kazan, Russia (invited). Conference Paper uri icon