Calude, Cristian, Information and randomness: an algorithmic perspective, Springer, 2002.
Cholak, Peter, Shore, Richard, and Solomon, Reed, A computably stable structure with no Scott family of finitary formulas, Archive for Mathematical Logic, vol. 45 (2006), pp. 519–538.
Hirschfeldt, Denis, Khoussainov, Bakhadyr, and Semukhin, Pavel, An uncountably categorical theory whose only computably presentable model is saturated, Notre Dame Journal of Formal Logic, vol. 47 (2006), pp. 63–71.
Hodges, Wilfrid, Model theory, Cambridge University Press, 1993.
Hodges, Wilfrid, A shorter model theory, Cambridge University Press, 1997.
Khoussainov, Bakhadyr, Nies, André, and Shore, Richard, Computable models of theories with few models, Notre Dame Journal of Formal Logic, vol. 38 (1997), pp. 165–178.
Khoussainov, Bakhadyr and Shore, Richard, Computable isomorphisms, degree spectra of relations and Scott families, Annals of Pure and Applied Logic, vol. 91 (1999), pp. 1–15 and vol. 98 (1999), pp. 297–298.
Kudinov, Oleg V., An autostable 1-decidable model without a computable scott family of ∃-formulas, Algebra and Logic, vol. 35 (1996), pp. 255–260, English translation.
Li, Ming and Vitányi, Paul, An introduction to Kolmogorov complexity audits applications, Texts and Monographs in Computer Science, Springer, 1993.
Marker, David, Model theory: an introduction, Springer, 2002.
Morley, Michael, Categoricity in power, Transactions of the American Mathematical Society, vol. 114 (1965), pp. 514–538.
Odifreddi, Piergiorgio, Classical recursion theory, North-Holland, 1989.
Soare, Robert I., Recursively enumerable sets and degrees, Springer, 1987.