We study the algorithmic content of Pontryagin - van Kampen duality. prove that process dualization is computable in important cases compact and locally totally disconnected Polish abelian groups. The applications our main results include solutions to questions Kihara Ng about presentations connected spaces, an unexpected arithmetical characterisation direct products solenoid groups among all