Harry R. Lewis
Harry Lewis in 2002
Born	1947 (age 76–77) Boston, Massachusetts, U.S.[5]
Education	Harvard University (BA, MA, PhD)
Title	Gordon McKay Professor of Computer Science (1981–present) Dean of Harvard College (1995–2003) Harvard College Professor (2003–2008)
Spouse	Marlyn McGrath (1968–present)[5]
Scientific career
Fields	Computer science Mathematical logic
Institutions	Harvard School of Engineering and Applied Sciences
Thesis	Herbrand Expansions and Reductions of the Decision Problem  (1974)
Doctoral advisor	Burton Dreben
Doctoral students	William Gasarch John Reif
Other notable students	Bill Gates[Note 1] David Leinweber[Note 2] Margo Seltzer[Note 3] Salil Vadhan[Note 4] Mark Zuckerberg[Note 5]
Uniformed service
Allegiance	United States
Service / branch	U.S. Public Health Service Commissioned Corps
Years of service	1968 - 1970
Rank	Lieutenant (junior grade)
Website	https://people.seas.harvard.edu/~lewis/

Harry Roy Lewis (born 1947) is an American computer scientist, mathe­ma­ti­cian, and uni­ver­sity admin­i­stra­tor known for his research in com­pu­ta­tional logic, textbooks in theoretical computer science, and writings on computing, higher education, and technology. He is Gordon McKay Research Professor of Computer Science at Harvard University, and was Dean of Harvard College from 1995 to 2003.

Essentially all of Lewis's career has been at Harvard, where he has been honored for his "particularly distinguished contributions to undergraduate teaching"; his students have included future entrepreneurs Bill Gates and Mark Zuckerberg, and numerous future faculty members at Harvard and other schools. The website "Six Degrees to Harry Lewis", created by Zuckerberg while at Harvard, was a precursor to Facebook.

Lewis was born in Boston^[7] and grew up in Wellesley, Massa­chu­setts.^[8] His parents were physicians – his father a hospital chief of anesthesiology and his mother the head of the Dever State School for intel­lec­tu­ally disabled children.^[9] His father was a World War II veteran and the son of a German Lutheran father and a Russian Jewish mother.^[10] After graduating summa cum laude at the end of the eleventh grade at Boston's Roxbury Latin School he entered Harvard College, where he was for a time a third-string lacrosse goalie.^[8]

Lewis has said that he discovered "I wasn't a real math­e­ma­ti­cian [once] I got out of the amateur leagues of high school mathematics", but was "tremendously excited" by the computer-science research oppor­tu­nities at Harvard.^[L2] As a senior he lectured a graduate class using a computer-graphics program, SHAPE­SHIFTER, which he had developed for displaying complex-plane trans­for­ma­tions on a cathode ray tube. SHAPE­SHIFTER automatically recognized formulas and commands hand-entered via a stylus on a RAND tablet, and could be "trained" to recognize the handwriting of individual users.^[6][11] There being no degree program in computer science per se at Harvard at the time,^[L2] in 1968 Lewis received his BA (summa, Quincy House) in applied mathematics^[5][12] and was elected to Phi Beta Kappa.^[13]

After serving for two years in the United States Public Health Service Commissioned Corps as a commissioned officer in the role of mathematician and computer scientist for the National Institutes of Health in Bethesda, Maryland, he spent a year in Europe as a Frederick Sheldon Traveling Fellow. He then returned to Harvard, where he earned his M.A. in 1973 and PhD in 1974, after which he was immediately appointed Assistant Professor of Computer Science. He became an Associate Professor in 1978, and Gordon McKay Professor of Computer Science in 1981.^[7]

Lewis formally retired in 2020,^[14][15] but continues to teach as Gordon McKay Research Professor in Computer Science.^[16] His wife Marlyn McGrath retired in 2021 after 42 years as Harvard College's director of admissions.^[17] The Harry Lewis and Marlyn McGrath Professorship of Engineering and Applied Sciences was endowed by one of Lewis's former students in 2012.^[18][19]

Teaching in 2012

Lewis has pointed out that – largely because his career began when the field of computer science "barely existed", and Harvard offered almost no computer science courses at the undergraduate level – he originated almost all the courses he has taught.^[20] It was his proposal, in the late 1970s, that Harvard create a major specifically for computer science^[21] (which until then had been a branch of Harvard's applied mathematics program).^[L2]

From 2003 to 2008 he was designated a Harvard College Professor in recognition of "particularly distinguished contributions to undergraduate teaching".^[22] In 2021 the IEEE Computer Society awarded him its annual Mary Kenneth Keller Computer Science & Engineering Undergraduate Teaching Award, citing "his over forty-year dedication towards undergraduate computer science education at Harvard, his authoring of Computer Science introductory textbooks, and his mentoring of many future educators."^[23]

Six of his teaching assistants^[24] are now members of the Harvard faculty^[20] and many others are professors of computer science (or related disciplines) elsewhere;^[25] many have gone on to win teaching awards themselves, including Eric Roberts (Association for Computing Machinery Karlstrom Award),^[26] Nicholas Horton (Robert V. Hogg Award),^[27] Joseph A. Konstan (University of Minnesota Distinguished University Teaching Professor, Graduate/Professional Teaching Award),^[28] and Margo Seltzer (Herchel Smith Professor of Computer Science at Harvard, Phi Beta Kappa teaching award, Abramson Teaching Award).^[29]

His undergraduate students have included Mark Zuckerberg (whose website "Six Degrees to Harry Lewis" was a precursor to Facebook – six degrees being a reference to the small world hypothesis),^{[Note 5]} Microsoft founder Bill Gates (who solved an open theoretical problem Lewis had described in class),^{[Note 1]} and nine future Harvard professors.^[20]

Lewis is the author or coauthor of five textbooks:

• An Introduction to Computer Programming and Data Structures using MACRO-11 (1981).^[L81] MACRO-11 was an assembly language for PDP-11 computers.
• Elements of the Theory of Computation (1981, with Christos H. Papadimitriou)^[LP81] covers automata theory, computational complexity theory, and the theory of formal languages; its inclusion of complexity theory and mathematical logic was innovative for its time. It has been called an "excellent traditional text" but one whose terse and heavily mathematical style can be intimidating. Although intended for undergraduates, it has also been used for introductory graduate courses.
• Data Structures and Their Algorithms (1991, with Larry Denenberg).^[LD]
• Essential Discrete Mathematics for Computer Science (2019, with Rachel Zax).^[31]
• Ideas that Created the Future (2021), a collection of "forty-six classic papers in computer science that map the evolution of the field."^[32]

Lewis has also taught a course on amateur athletics and the social history of sports in America.^[7]

In 1994 Lewis coauthored the "comprehensive" Report on the Structure of Harvard College,^[33][34] and in 1995^[22] he was appointed dean of Harvard College, responsible for the nonacademic aspects of undergraduate life.^[35] In that capacity he oversaw a number of sometimes-controversial policy changes, including changes to the handling of allegations of sexual assault, reorganization of the college's public-service programs, a crackdown on underage alcohol consumption, and random assignment of students to upperclass houses (countering the social segregation found under the prior system of assignment according to student preference).^{[Note 6][5][36]} He also pressed improvements to advising and health care.^[5][37][38] A colleague has said that Lewis "reshaped undergraduate life more powerfully than anyone else in recent memory."^[39] Lewis continued to teach throughout his time as dean.^[22]

After the 2001 inauguration of Harvard University's twenty-seventh president, Lawrence Summers, Lewis and Summers came into conflict over the direction of Harvard College and its educational philosophy.^{[5][40][33][41]} Lewis, for example, emphasized the importance of extracurricular pursuits, advising incoming freshmen that "flexibility in your schedule, unstructured time in your day, and evenings spent with your friends rather than your books are all, in a larger sense, essential for your education", while Summers complained of an insufficiently intellectual "Camp Harvard" and admonished students that "You are here to work, and your business here is to learn."^{[42][L06]: 86–90 [L1]} After Lewis issued what The Harvard Crimson called "a scathing indictment of the view that increasing intellectual rigor ought to be the [College's] priority" – pointing out that prospective employers show less interest in grades than in personal qualities built outside the classroom^[40] – he was peremptorily removed as dean in March 2003.^{[40][43][38][5]}

In 2015 Lewis served as interim Dean of the Harvard School of Engineering and Applied Sciences.^[44]

Lewis is a Faculty Associate of Harvard's Berkman Center for Internet & Society.^[45] In addition to his research publications and textbooks, he has written a number of works on higher education and the impact of computers on society.

Drawing heavily on his experience as dean of Harvard College, his Excellence Without A Soul: How a Great University Forgot Education (2006) critiques what he sees as the abandonment by American universities, including Harvard, of the

fundamental job of undergraduate education  ... to turn eighteen- and nineteen-year-olds into twenty-one- and twenty-two-year-olds, to help them grow up, to learn who they are, to search for a larger purpose for their lives, and to leave college as better human beings.^[L06]: xii

In "Renewing the Civic Mission of American Higher Education" (with Ellen Condliffe Lagemann, 2012) Lewis warns that "a flourishing multiplicity of worthy but uncoordinated agendas has crowded out higher education's commitment to the common good":

The ongoing erosion of civic concerns within American higher education is alarming and dangerous  ... [Colleges] are a natural place for citizens to learn values beyond their own personal welfare, to see themselves as part of a society of mutual rights and respon­si­bil­i­ties. They should be settings in which engagement with questions concerning justice and goodness is essential to daily routines  ... Effective civic education must simul­ta­ne­ously involve students' capacities for thinking intel­lec­tu­ally, for making moral judgments, and for [taking action in response to those judgments]  ... Free societies will not thrive unless colleges, graduate schools, and pro­fes­sional schools understand that the civic health of the nation is one of their central respon­si­bil­ities.^{[LL]: 10-11}

Developed from a course taught by its authors, Blown to Bits: Your Life, Liberty, and Happiness After the Digital Explosion (2008, with Hal Abelson and Ken Ledeen) explores the origins and consequences of the 21st-century explosion in digital information, including its impact on culture and privacy:

It is now possible, in principle, to remember everything that anyone says, writes, sings, draws, or photographs. Everything  ... Global computer networks can make it available to everywhere in the world, almost instantly. And computers are powerful enough to extract meaning from all that information, to find patterns and make connections in the blink of an eye.

In centuries gone by, others may have dreamed these things could happen, in utopian fantasies or in nightmares. But now they are happening.^{[ALL]: xiii}

Baseball as a Second Language: Explaining the Game Americans Use to Explain Everything Else (self-published as an experiment in open access in 2011)^[46] discusses the many ways baseball concepts and imagery have made their way into American English.^[47] It was inspired by Lewis' experiences explaining baseball to international students.^[46]

Lewis' undergraduate thesis describing SHAPESHIFTER, "Two applications of hand-printed two-dimensional computer input",^[L68] was written under computer graphics pioneer Ivan Sutherland^[7] and presented at the 23rd National Conference of the Association for Computing Machinery in 1968. It was followed by several papers on related topics.^[11]

Much of Lewis' subsequent research concerned the computational complexity of problems in mathematical logic. His doctoral thesis, "Herbrand Expansions and Reductions of the Decision Problem", was supervised by Burton Dreben and dealt with Herbrand's theorem.^[7][48] His 1979 book, Unsolvable classes of quantificational formulas^[L79] complemented The Decision Problem: Solvable classes of quantificational formula by Dreben and Warren Goldfarb.^[49]

His 1978 paper "Renaming a set of clauses as a Horn set" addressed the Boolean satisfiability problem, of determining whether a logic formula in conjunctive normal form can be made true by a suitable assignment of its variables. In general, these problems are hard, but there are two major subclasses of satisfiability for which polynomial time solutions are known: 2-satisfiability (where each clause of the formula has two literals) and Horn-satisfiability (where each clause has at most one positive literal). Lewis expanded the second of these subclasses, by showing that the problem can still be solved in polynomial time when the input is not already in Horn form, but can be put into Horn form by replacing some variables by their negations. The problem of choosing which variables to negate to make each clause get two positive literals, making the re-signed instance into a Horn set, turns out to be expressible as an instance of 2-satisfiability, the other solvable case of the satisfiability problem. By solving a 2-satisfiability instance to turn the given input into a Horn set, Lewis shows that the instances that can be turned into Horn sets can also be solved in polynomial time.^[L78] The time for the sign reassignment in the original version of what Lindhorst and Shahrokhi called "this elegant result"^[50] was O (mn²) for an instance with m clauses and n variables, but it can be reduced to linear time by breaking long input clauses into smaller clauses and applying a faster 2-satisfiability algorithm.^[51]

Lewis' paper "Complexity results for classes of quantificational formulas" (1980) deals with the computational complexity of problems in first-order logic. Such problems are undecidable in general, but there are several special classes of these problems, defined by restricting the order in which their quantifiers appear, that were known to be decidable. One of these special classes, for instance, is the Bernays–Schönfinkel class. For each of these special classes, Lewis establishes tight exponential time bounds either for deterministic or nondeterministic time complexity. For instance, he shows that the Bernays–Schönfinkel class is NEXPTIME-complete, and more specifically that its nondeterministic time complexity is both upper- and lower-bounded by a singly exponential function of the input length.^[L80] Börger, Grädel, and Gurevich write that "this paper initiated the study of the complexity of decidable classes of the decision problem".^[52]

"A logic of concrete time intervals" (1990) concerned temporal logic.^[L90] This paper accompanied an earlier Aiken Computation Laboratory technical report, "Finite-state analysis of asynchronous circuits with bounded temporal uncertainty", where he first proposed the representation of an asynchronous circuit, with bounded temporal uncertainty on gate transition events, as a finite-state machine. This paper was the earliest work on the verification of timing properties that modeled time both asynchronously and continuously, neither discretizing time nor imposing a global clock.^[53]

Some of Lewis' other heavily cited research papers extend beyond logic. His paper "Symbolic evaluation and the global value graph" (1977, with his student John Reif) concerned data-flow analysis and symbolic execution in compilers.^[RL] And his paper "Symmetric space-bounded computation" (1982, with Christos Papadimitriou)^[LP82] was the first to define symmetric Turing machines and symmetric space complexity classes such as SL (an undirected or reversible analogue of nondeterministic space complexity, later shown to coincide with deterministic logarithmic space).^[54] In 1982, he chaired the program committee for the Symposium on Theory of Computing,^[STOC] one of the two top research conferences in theoretical computer science, considered broadly.^[55]

Lewis is a Visitor of Ralston College and a Life Trustee of the Roxbury Latin School.^[56] From 1995 to 2003 he was Trustee of the Charity of Edward Hopkins.^[7] The New York Times journalist David Fahrenthold is his son-in-law;^[57] while still a Harvard undergraduate, Fahrenthold wrote of his future father-in-law:

I've heard that if you sit out by the river [i.e. the Charles River] long enough, Dean of the College Harry R. Lewis '68 comes along and hands out computer science problem sets so you'll get back to work.^[58]

• "Bits and Pieces" Lewis' blog
• "Blown to Bits" Lewis' old blog