This is a good article. Click here for more information.

Harry R. Lewis

From Wikipedia, the free encyclopedia
Jump to: navigation, search
Harry R. Lewis
Harry Lewis in Harvard Student Meeting 2002 cropped.jpg
Born 1947 (age 69–70)
Boston[1]
Nationality American
Title Gordon McKay Professor of Computer Science (1981–present)
Dean of Harvard College (1995–2003)
Harvard College Professor (2003–2008)
Spouse(s) Marlyn McGrath (1968–present)[1]
Website people.seas.harvard.edu/~lewis/
Academic background
Education Roxbury Latin School
Harvard University
Thesis title Herbrand Expansions and Reductions of the Decision Problem
Thesis year 1974
Doctoral advisor Burton Dreben
Academic work
Discipline Computer science
Mathematical logic
Sub discipline Decidability
Theory of computation
Institutions Harvard School of Engineering and Applied Sciences
Doctoral students
Notable students

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 Professor of Computer Science at Harvard University, and was Dean of Harvard College from 1995 to 2003.

Lewis 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.

A new professorship in Engineering and Applied Sciences, endowed by a former student, will be named for Lewis and his wife upon their retirements.

Education and career[edit]

A young man sits holding a microphone in his left hand while manipulating the console of an apparatus with his right. To his left a large television camera is trained on a large, circular cathode ray tube display.
Lewis dem­on­strat­ing his senior thesis project, SHAPE­SHIFTER, via video link to a class in another room[6][L68]

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] 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][10] 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[1][11] and was elected to Phi Beta Kappa.[12]

After two years as a 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 has been Gordon McKay Professor of Computer Science since 1981.[7]

Lewis plans to retire in 2020,[13] at which time a new professorship in Engineering and Applied Sciences, endowed by former student Larry Lebowitz, will be named for Lewis and for his wife Marlyn McGrath, who is Harvard's director of admissions.[14]

Teaching[edit]

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.[15] It was his proposal, in the late 1970s, that Harvard create a major specifically for computer science[16] (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".[17] Six of his teaching assistants[18] are now members of the Harvard faculty[15] and many others are professors of computer science (or related disciplines) elsewhere;[19] many have gone on to win teaching awards themselves, including Eric Roberts (Association for Computing Machinery Karlstrom Award),[20] Nicholas Horton (Robert V. Hogg Award),[21] Joseph A. Konstan (University of Minnesota Distinguished University Teaching Professor, Graduate/Professional Teaching Award),[22] and Margo Seltzer (Herchel Smith Professor of Computer Science at Harvard, Phi Beta Kappa teaching award, Abramson Teaching Award).[23]

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.[15]

Lewis is the author or coauthor of three undergraduate textbooks:

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

Dean of Harvard College[edit]

On Halloween 1982, Lewis' teach­ing assis­tants appeared at his home in "Harry Lewis" costume, includ­ing his then-trademark mus­tache and pipe. Future Harvard professor Margo Seltzer is at left.[19]

In 1994 Lewis coauthored the "comprehensive" Report on the Structure of Harvard College,[25][26] and in 1995[17] he was appointed dean of Harvard College, responsible for the nonacademic aspects of undergraduate life.[27] 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 use, 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][1][28] He also pressed improvements to advising and health care.[1][29][30] A colleague has said that Lewis "reshaped undergraduate life more powerfully than anyone else in recent memory."[31]

After the 2001 inauguration of Harvard University's twenty-seventh president, Lawrence Summers, Lewis and Summers came into conflict over the direction of the College and its educational philosophy.[1][32][25][33] 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."[34][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[32] – he was peremptorily removed as dean in March 2003.[32][35][30][1]

Lewis continued to teach throughout his time as dean.[17] In 2015 he served as interim Dean of the Harvard School of Engineering and Applied Sciences.[36]

Writings on education and technology[edit]

Lewis is a Faculty Associate of Harvard's Berkman Center for Internet & Society.[37] 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)[38] discusses the many ways baseball concepts and imagery have made their way into American English.[39] It was inspired by Lewis' experiences explaining baseball to international students.[38]

Research[edit]

Lewis in his office (2016)

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.[10]

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][40] His 1979 book, Unsolvable classes of quantificational formulas[L79] complemented The Decision Problem: Solvable classes of quantificational formula by Dreben and Warren Goldfarb.[41]

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"[42] was O(mn2) 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.[43]

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".[44]

"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.[45]

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).[46] 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.[47]

Personal[edit]

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

I've heard that if you sit out by the 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.[50]

Notes[edit]

  1. ^ a b Gates was a sophomore in Lewis' combinatorics class when Lewis posed the pancake sorting problem as "an example of a problem that was easy to describe but [nonetheless] had not been solved". Gates brought a solution to Lewis a few days afterward, and later published it with the assistance of Christos Papadimitriou, an assistant professor at Harvard at the time.[2]
  2. ^ Leinweber became a financial analyst after joining the Harvard applied mathematics graduate program intending to study computer graphics, but discovering that the graphics courses were no longer taught. Lewis became his "de facto advisor", steered him to broader studies, and (through his connections with the RAND Corporation) helped get him his first job.[3]
  3. ^ Seltzer worked for Lewis as an undergraduate teaching assistant in a course that, years later, she herself taught after joining the Harvard faculty.[4]
  4. ^ Vadhan writes that taking Lewis' course as an undergraduate "opened my eyes to the deep and beautiful theory on which computer science is built ... What I found extraordinary ... was that students could learn about open problems at the frontier of the field – basic problems that we aren't even close to solving – in an introductory course." Later, a 2004 sabbatical by Lewis gave Vadhan the chance to teach the same course himself.[5]
  5. ^ a b In 2004 Zuckerberg wrote to Lewis,
    Professor, I've been interested in graph theory and its applications to social networks for a while now, so I did some research ... that has to do with linking people through articles they appear in from [The Crimson, the Harvard student newspaper]. I thought people would find this interesting, so I've set up a preliminary site that allows people to find the connection (through people and articles) from any person to the most frequently mentioned person in the time frame I looked at. That person is you.
    I wanted to ask your permission to put this site up though, since it has your name in its title.
    After some discussion Lewis gave his approval: "Sure, what the hell. Seems harmless."[24]
  6. ^ See Harvard College § House system.

Selected publications[edit]

Computer science research[edit]

L68. Lewis, Harry R. (1968). Two applications of hand-printed two-dimensional computer input (Thesis). Harvard University. 
RL. Reif, John H.; Lewis, Harry R. (1977). "Symbolic evaluation and the global value graph". Proceedings of the 4th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages (POPL '77). New York: ACM. pp. 104–118. doi:10.1145/512950.512961. 
L78. Lewis, Harry R. (1978). "Renaming a set of clauses as a Horn set". Journal of the ACM. 25 (1): 134–135. MR 0468315. doi:10.1145/322047.322059. 
L79. —— (1979). Unsolvable classes of quantificational formulas. Addison-Wesley. 
L80. —— (1980). "Complexity results for classes of quantificational formulas". Journal of Computer and System Sciences. 21 (3): 317–353. MR 603587. doi:10.1016/0022-0000(80)90027-6.  A preliminary version, "Complexity of solvable cases of the decision problem for the predicate calculus", was presented at the Symposium on Foundations of Computer Science, 1978.
LP82. ——; Papadimitriou, Christos H. (1982). "Symmetric space-bounded computation". Theoretical Computer Science. 19 (2): 161–187. MR 666539. doi:10.1016/0304-3975(82)90058-5.  A preliminary version was presented at the International Colloquium on Automata, Languages and Programming, 1980.
STOC. ——, ed. (1982). Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing. Association for Computing Machinery. 
L90. —— (1990). "A logic of concrete time intervals (extended abstract)". Fifth Annual IEEE Symposium on Logic in Computer Science (Philadelphia, PA, 1990). Los Alamitos: IEEE Computer Society Press. pp. 380–389. MR 1099190. doi:10.1109/LICS.1990.113763. 

Computers and society[edit]

ALL. ——; Abelson, Hal; Ledeen, Ken (2008). Blown to Bits: Your Life, Liberty, and Happiness After the Digital Explosion. Addison-Wesley.  Also translated into Chinese and Russian.
L09. —— (2009). "Digital Books". International Journal of the Humanities. 7 (8): 59–66. 
L11a. —— (2011). Shephard, Jennifer M.; Kosslyn, Stephen Michael; Hammonds, Evelynn Maxine, eds. "The Internet and Hieronymus Bosch: Fear, Protection, and Liberty in Cyberspace". The Harvard Sampler: Liberal Education for the Twenty-First Century. Harvard University Press. pp. 57–90. ISBN 978-0-674-05902-3. 

Textbooks[edit]

L81. —— (1981). An Introduction to Computer Programming and Data Structures using MACRO-11. Reston Publishing Company. 
LP81. ——; Papadimitriou, Christos H. (1981). Elements of the Theory of Computation. Prentice-Hall.  2nd ed., 1997. Various translations.
  • Gallier, Jean H. (September 1984). "Review: Elements of the Theory of Computation by Harry R. Lewis; Christos H. Papadimitriou". Journal of Symbolic Logic. 49 (3): 989–990. doi:10.2307/2274157. 
  • Greenleaf, Newcomb. "Bringing mathematics education into the algorithmic age". In Myers, J. Paul, Jr.; O'Donnell, Michael J. Constructivity in Computer Science: Summer Symposium San Antonio, TX, June 19–22, 1991, Proceedings. Lecture Notes in Computer Science. 613. Springer. pp. 199–217. doi:10.1007/bfb0021092.  See in particular p. 205.
LD. ——; Denenberg, Larry (1991). Data Structures and Their Algorithms. HarperCollins. 

Higher education[edit]

L1. ——. "Slow Down: Getting More out of Harvard by Doing Less" (PDF).  (Advice to incoming Harvard College students.)
L2. ——. Jacobson, Matthew, ed. "Harry Lewis, professor of computer science and former dean of college, Harvard University". The Education Project. 
L06. —— (2006). Excellence Without a Soul: How a Great University Forgot Education]]. PublicAffairs.  Trans. Chinese, Korean.
LL. ——; Lagemann, Ellen Condliffe (2011). Lewis, Harry R.; Ellen Condliffe, Lagemann, eds. "Renewing the Civic Mission of American Higher Education". What is College For? The Public Purpose of Higher Education. Teachers College Press. 
L11b. —— (2011). Education, Books, & Society in the Information Age: The Hong Kong Lectures. Chameleon Press. 

Other[edit]

L11c. —— (2011). Baseball as a Second Language: Explaining the Game Americans Use to Explain Everything Else. Self-published. [38]

References[edit]

  1. ^ a b c d e f g Bradley, Richard (2005). Harvard rules: the struggle for the soul of the world's most powerful university (1st ed.). HarperCollins. pp. 229–242. ISBN 0-06-056854-2. 
  2. ^ Kestenbaum, David (July 4, 2008). "Before Microsoft, Gates Solved A Pancake Problem". National Public Radio. 
  3. ^ Lindsey, Richard R.; Schachter, Barry, eds. (2011). How I Became a Quant: Insights from 25 of Wall Street's Elite. John Wiley & Sons. p. 13. ISBN 9781118044759. 
  4. ^ Cromie, William J. (September 28, 2000). "Making it all compute: Blackbelt, professor, mom, Seltzer integrates career and family". Harvard Gazette. 
  5. ^ "Salil Vadhan: The Beauty of Computer Science". Faculty profiles. Harvard John A. Poulson School of Engineering and Applied Sciences. Retrieved April 3, 2017. 
  6. ^ a b Kramer, Joel R. (November 9, 1967). "Computer Stops Counting, Draws". The Harvard Crimson. 
  7. ^ a b c d e f "Harry Lewis curriculum vitae". Lewis.seas.harvard.edu. Retrieved 2017-03-21. 
  8. ^ a b Rochelson, David B. (April 29, 2003). "Lewis Defended University Athletics". The Harvard Crimson. 
  9. ^ King, Mary Sarah (December 21, 1969). "Dr. Anne H. Lewis, Dever State School head". Boston Globe. pp. A19. 
  10. ^ a b "An interactive program for experimenting with complex-plane transformations"; Proceedings of the 23rd National Conference of the Association for Computing Machinery, 1968; pp. 717–724
    • "An interactive graphics facility under the PDP-10/50 timesharing monitor"; Proceedings of the DECUS Fall 1969 Conference; pp. 59–62
    • "Techniques for generating, manipulating, and storage management of type 340 display files"; Proceedings of the DECUS Fall 1969 Conference; pp. 67–74
    • "A device to make a Rand tablet act like a light pen"; Proceedings of the DECUS Spring 1970 Conference; pp. 249–251 (with Malcolm C. Bruce)
  11. ^ Rochelson, David B. (April 30, 2003). "Foundation Honors Advocates of Diversity". The Harvard Crimson. 
  12. ^ "PBK Elects". The Harvard Crimson. November 16, 1967. 
  13. ^ Debenedictis, Julia E. (February 28, 2017). "Harry Lewis To Retire After 46 Years". The Harvard Crimson. 
  14. ^ "I Choose Harvard: Laurence Lebowitz ’82, MBA’88 | Stories | Harvard Alumni". Alumni.harvard.edu. 2017-03-17. Retrieved 2017-03-21. 
  15. ^ a b c Lewis, Harry R. (March 1, 2017). "An odd fact about my teaching career". Bits and Pieces. 
  16. ^ Guo, Cynthia (February 18, 2016). "Professor Harry Lewis". The Harvard Crimson. 
  17. ^ a b c McGreevey, Sue (May 22, 2003). "Five teachers honored with Harvard College Professorships | Harvard Gazette". News.harvard.edu. 
  18. ^ "Teaching Fellows | Harry R. Lewis". Lewis.seas.harvard.edu. Retrieved 2017-03-21. 
  19. ^ a b Lewis, Harry R. (October 4, 2012). "A 30th Anniversary Family Photo". Bits and Pieces. 
  20. ^ "ACM Karl V. Karlstrom Outstanding Educator Award – Award Winners: Alphabetical Listing". Awards.acm.org. Retrieved 2017-03-21. 
  21. ^ "SIGMAA on Statistics Education". Sigmaa.maa.org. Retrieved 2017-03-21. 
  22. ^ "Award for Outstanding Contributions to Postbaccalaureate, Graduate, and Professional Education". Scholars Walk. University of Minnesota. March 6, 2017. Retrieved 2017-03-21. 
  23. ^ "Margo I. Seltzer | Harvard John A. Paulson School of Engineering and Applied Sciences". Seas.harvard.edu. Retrieved 2017-03-21. 
  24. ^ Lewis, Harry R. (November 7, 2011). "My Real Contribution to the Birth of Facebook". Bits and Pieces. 
  25. ^ a b Blenkinsopp, Alexander J.; O'Brien, Rebecca D. (June 5, 2003). "Constructing the Deanship: One Man's Job". The Harvard Crimson. 
  26. ^ Committee on the Structure of Harvard College (August 19, 1994). Report on the Structure of Harvard College. Submitted to the Dean of the Faculty of Arts and Sciences (PDF) (Report). p. 83. 
  27. ^ "Lewis Forced Out: Dean of College to leave post after almost eight years". The Harvard Crimson. March 18, 2003. 
  28. ^ Macmillan, Valerie J. (January 31, 1996). "Lewis' Trying Term". The Harvard Crimson. 
  29. ^ "Lewis to conclude service as College offices unite". Harvard Gazette. March 20, 2003. 
  30. ^ a b "Deconstructing the college deanship". John Harvard's Journal. Harvard Magazine. May–June 2003. 
  31. ^ Shaw, Jonathan. "A Tribute to Harry Lewis". Harvard Magazine. 
  32. ^ a b c Theodore, Elisabeth S.; Vascellaro, Jessica E. (March 18, 2003). "Lewis Departure May Mean Shift in College's Priorities". The Harvard Crimson. 
  33. ^ Blenkinsopp, Alexander J. (June 5, 2003). "Dean Ousted In College Shakeup". The Harvard Crimson. 
  34. ^ Kessler, Judd B. (April 8, 2003). "A 168-Hour Week". The Harvard Crimson. 
  35. ^ Freinberg, Anthony S. A. (March 21, 2003). "Debunking 'Camp Harvard'". The Harvard Crimson. 
  36. ^ "A new dean for SEAS | Harvard John A. Paulson School of Engineering and Applied Sciences". Seas.harvard.edu. 2015-05-14. Retrieved 2017-03-21. 
  37. ^ "People | Berkman Klein Center". Cyber.law.harvard.edu. Retrieved 2017-03-21. 
  38. ^ a b c Lewis, Harry R. (August 18, 2011). "Baseball as a Second Language". Bits and Pieces. 
  39. ^ "Lingua Branca: Harry Lewis explains how baseball explains everything". John Harvard's Journal. Harvard Magazine. March–April 2012. 
  40. ^ Harry Roy Lewis at the Mathematics Genealogy Project
  41. ^ Dreben, Burton; Goldfarb, Warren D. (1979). The decision problem: solvable classes of quantificational formulas. Addison-Wesley. 
  42. ^ Lindhorst, Greg; Shahrokhi, Farhad (1989). "On renaming a set of clauses as a Horn set". Information Processing Letters. 30 (6): 289–293. MR 994523. doi:10.1016/0020-0190(89)90229-9. 
  43. ^ Aspvall, Bengt (1980). "Recognizing disguised NR(1) instances of the satisfiability problem". Journal of Algorithms. 1 (1): 97–103. MR 578079. doi:10.1016/0196-6774(80)90007-3. 
  44. ^ Börger, Egon; Grädel, Erich; Gurevich, Yuri (1997), The classical decision problem, Perspectives in Mathematical Logic, Berlin: Springer-Verlag, p. 456, ISBN 3-540-57073-X, MR 1482227, doi:10.1007/978-3-642-59207-2 
  45. ^ Dill, David L. (1990). "Timing assumptions and verification of finite-state concurrent systems". Automatic Verification Methods for Finite State Systems: International Workshop, Grenoble, France June 12–14, 1989, Proceedings. Lecture Notes in Computer Science. 407. Springer-Verlag. pp. 197–212. ISBN 3-540-52148-8. 
  46. ^ Moore, Cristopher; Mertens, Stephan (2011). "8.10 Symmetric space". The nature of computation. Oxford University Press, Oxford. ISBN 978-0-19-923321-2. MR 2849868. doi:10.1093/acprof:oso/9780199233212.001.0001. 
  47. ^ Fich, Faith (1996). "Infrastructure issues related to theory of computing research". ACM Computing Surveys. 28 (4es): 217. doi:10.1145/242224.242502. .
  48. ^ "Our Trustees". Roxburylatin.org. Retrieved 2017-03-21. 
  49. ^ "Elizabeth Lewis and David Fahrenthold". The New York Times. August 21, 2005. 
  50. ^ Fahrenthold, David A. (May 22, 2000). "A Vision of the Future". The Harvard Crimson. 

External links[edit]