How do you represent an r.e. complexity class with a list of TMs?
Its easy to iterate through all turing machines - simply iterate through all strings, and pick the ones that actually represent a TM.

I think its possible to iterate through all $P$ by iterating through all turing machines, and for each one to add a "clock" that counts the number of steps and halts after some polynomial time.