Does someone know: what is the complexity (in the arithmetical hierarchy) of Godel numbers of Turing machines that run in time O(n^k) for a fixed k>0? Thank you, Jan Pax