Abstract
We prove that no computable tree of infinite height is computably categorical, and indeed that all such trees have computable dimension ω. Moreover, this dimension is effectively ω, in the sense that given any effective listing of computable presentations of the same tree, we can effectively find another computable presentation of it which is not computably isomorphic to any of the presentations on the list.
Citation
Russell Miller. "The computable dimension of trees of infinite height." J. Symbolic Logic 70 (1) 111 - 141, March 2005. https://doi.org/10.2178/jsl/1107298513
Information
