Self-embeddings of computable trees

Stephen Binns, Bjørn Kjos-Hanssen, Manuel Lerman +2

We divide the class of infinite computable trees into three types. For the first and second types, $0^{\prime }$ computes a nontrivial self-embedding while for the third type $0^{\prime \prime }$ computes…