All the recursive real functions are continuous; in fact all the B-recursive real functions are continuous for any oracle B, simply because Turing Machines computing them are nite objects. But simple functions like step functions have to be in some sense be \easy" if they have recursive values and break points, although by our usual deeni-tion, they are not computable at all. So it seems unfair...