Computable paradoxical decompositions

Karol Duda, Aleksander Ivanov

We prove a computable version of Hall's Harem Theorem and apply it to computable versions of Tarski's alternative theorem.