We describe strongly minimal theories with finite languages such that in the chain of countable models of , only the first models have recursive presentations. Also, we describe a strongly minimal theory with a finite language such that every non-saturated model has a recursive presentation.