Abstract Given an admissible indexing φ of the countable atomless Boolean algebra ℬ, an automorphism F of ℬ is said to be recursively presented (relative to φ ) if there exists a recursive function p ϵ Sym( ω ) such that F ∘ φ = φ ∘ p . Our key result on recursiveness: Both the subset of Aut(ℬ) consisting of all those automorphisms which are recursively presented relative to some indexing, and its complement, the set of all “totally nonrecursive” automorphisms, are uncountable. This arises as a consequence of the following combinatorial investigations: (1) A comparison of the cycle structures of ƒ and , where ƒ is a permutation of some free basis of ℬ and is the automorphism of ℬ induced by ƒ .(2) An explicit description of the permutations of ω whose conjugacy classes in Sym( ω ) are (a) uncountable, (b) countably infinite, and (c) finite.