We suggest to consider a generalization of the notion of computable model by letting the predicates and the functions of a countable model be computable with respect to zero-prime oracle. We call such models limitly constructible models and study their autostability as well as generalized autostability (automorphism representable by zero-prime computable functions).