1. Aaronson, S. (2005). Guest column: NP-complete problems and physical reality. ACM SIGACT News, 36(1), 30–52.
2. Aaronson, S. (2013). 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. Abend, O., Kwiatkowski, T., Smith, N., Goldwater, S., & Steedman, Mark. (2017). Bootstrapping language acquisition. Cognition, 164, 116–143.
4. ACM. (2012). ACM turing centenary celebration. Association for Computing Machinery, June 15–16, San Francisco. http://turing100.acm.org/ .
5. Bickhard, M. H. (1996). Troubles with computationalism. In W. O’Donohue & R. Kitchener (Eds.), Philosophy of psychology (pp. 173–183). London: Sage.