joint work with Bartek Klin, Sławomir Lasota, Szymon Toruńczyk) - continuatio

We study deterministic computability over sets with atoms. We characterize those alphabets for which Turing machines with atoms determinize. To this end, the determinization problem is expressed as a Constraint Satisfaction Problem, and a characterization is obtained from deep results in CSP theory.