A computable version of Hall's Harem Theorem and Geometric von Neumann Conjecture

We prove a computable version of the Hall Harem Theorem where the matching realizes a unary function with controlled sizes of cycles. We apply it to non-amenable computable coarse spaces. As a result, we obtain a computable version of the geometric von Neumann conjecture.