1. Aaronson, S. (2013a). Quantum computing since Demokritus. Cambridge: Cambridge University Press.
2. Aaronson, S. (2013b). Why philosophers should care about computational complexity. In B. J. Copeland, C. J. Posy, & O. Shagrir (Eds.), Computability: Turing, Gödel, Church, and beyond. Cambridge: MIT Press.
3. Abramson, F. G. (1971). Effective computation over the real numbers. In IEEE 54th Annual Symposium on Foundations of Computer Science, Los Alamitos (pp. 33–37).
4. Arora, S., & Barak, B. (2009). Computational complexity: A modern approach. Cambridge: Cambridge University Press.
5. Avcu, E. (2014). Nouns-first, verbs-first and computationally easier first: A preliminary design to test the order of acquisition. Unpublished master’s thesis, Cognitive Science department, Middle East Technical University (ODTÜ), Ankara.