Recently there has been a lot of interest in computation in totally disconnected, locally compact groups (for instance by G. Willis and his co-workers in Newcastle). We give various notions of computable psentation of such a group and show their equivalence. One of them relies on the (countable) meet groupoid given by the compact open cosets. The class of computably t.d.l.c. groups turns out to be robust and have good closure properties. The notion of computable presentation allows us to rigorously formulate the question whether the modular orhe scale functions are computable. This is joint work with Alexander Melnikov.