Proper divisibility in computable rings

We study divisibility in computable integral domains. We develop a technique for coding Σ20 binary trees into the divisibility relation of a computable integral domain. We then use this technique to prove two theorems about non-atomic integral domains.