1. Aaronson, S. (2013). Why philosophers should care about computational complexity. In B. J. Copeland & O. S. C. Posy (Eds.), Computability: Turing, gdel, church, and beyond (pp. 261–328). London: MIT Press.
2. Adleman, L. (1994). Molecular computation of solutions to combinatorial problems. Science, 226, 1021–1024.
3. Lecture Notes in Computer Science;A Alhazov,2004
4. Bickle, J. (2013). Multiple realizability. In E. N. Zalta (Ed.), The Stanford encyclopedia of philosophy (2013th ed.). Berlin: Springer.
5. Book, R., & Otto, F. (1993). String-rewriting systems. Berlin: Springer.