4L.M. Adleman. Molecular Computation of Solutions to Combinatorial Problems. Science. 1994. 266:1020-1024.
5Jeannette M. Wing. Computational Thinking[J]. Communications of the ACM, 2006, 49(3): 33-35.
6R. Penrose. The Emperor's new mind, concerningcomputers, mind, and the law of physics[M]. Oxford, NewYork, Melbourne: Oxford University Press;中译本:徐明贤,吴忠超译.长沙:湖南科学技术出版社,1999:
7L.Babai, S. Moran. Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes[J]. Journal of computer and system scineces, 1988, 36, 254-276.
8R. Canetti. More on BPP and the polynomial-time hierarchy[J]. Information processing letters, 1996, 57, 237-241.
9S. Goldwasser, S. Micali, C. Rackoff. The knowledge complexity of interactive proof-system[J]. SIAM Journal on Computing, 1989, 18(1), 186-208.
10Lindsay, R. & Gorayska, B. Relevance. Goals and Cognitive Technology[J]. International Journal of Cognitive Technology, 2002, 1(2): 187-232.
