CACM has published a fantastic retrospective in the form of an extended interview with Juris Hartmanis, in which the pioneer in the field of computational complexity theory reflects on his career.
Excerpt describing the beginning of Hartmanis' collaboration with Richard Stearns, which would result in their joint Turing award: "[we] started working together during the summer and hit it off really well. When he finished his Ph.D. and joined the [G.E.] research lab as a research mathematician, we worked day in and day out together, sitting and staring at each other in his office or mine, shouting and hollering about the other's ignorance for not understanding the subtlest points of computability."
Condensed and edited version preview (full edited version behind ACM paywall): http://cacm.acm.org/magazines/2015/4/184690-an-interview-with-juris-hartmanis/abstract
Full text of the oral-history interview (behind paywall): http://dl.acm.org/citation.cfm?id=1141880.1775727