📄 http:^^www.das.harvard.edu^users^faculty^harry_lewis^harry_lewis.html
字号:
Date: Wed, 20 Nov 1996 23:00:46 GMTServer: NCSA/1.5Content-type: text/htmlLast-modified: Wed, 23 Mar 1994 00:46:34 GMTContent-length: 2490<HTML><HEAD><title>Harry R. Lewis</title></HEAD><BODY><h1>Harry Lewis</h1><!WA0><img align=top src=http://www.das.harvard.edu/users/faculty/Harry_Lewis/Harry_Lewis.gif><h3>Gordon McKay Professor of Computer Science</h3><h3>THEORY OF COMPUTATION AND COMPUTER SYSTEMS </h3>Theoretical computer science has its roots in mathematicallogic. In the 1930s, using mathematical automata, Turing investigated whether the truth of mathematical propositionscould be determined by algorithmic procedures; since then,studies of formalized computers and formalized mathematicalsystems have continued to complement and enrich one another. <p>Professor Lewis has worked extensively on the algorithmicsolvability of logical, computational, and combinatorialsystems, attempting to clarify the relations between themand to identify their common characteristics. For example,he has applied automata theory to the classical predicate calculus and to circuit models for parallel computers.<p>Currently he is working on practical formal methods for design verification of asynchronous systems, such asboolean circuits and signalling protocols. Timing characteristicsof such systems are notoriously difficult to validate underrealistic models of their behavior, andmost practical computer-aided design tools rely on inexhaustivesimulation rather than complete verification. Professor Lewishas developed both a theoretical logical framework for the timing specification of asynchronous systems, and software that uses this specification languageto verify the functionality of asynchronous boolean circuitswhose components have specified minimum and maximum time delays.<p>Professor Lewis is actively involved in the use of computers in education,and his books have had a significant influence onthe teaching of the foundations of computer science to undergraduates.<hr><ul><li>H. R. Lewis and L. Deneberg, <i>Data Structures and TheirAlgorithms</i>, HarperCollins Publishers, New York, NY (1991). <li><i>A logic of concrete time intervals,</i> Proc. Fifth Annual IEEESymposium on Logic in Computer Science, IEEE, 380-389 (1990).<li>H. R. Lewis and J. Tecosky, <i>MacFunction (Software for the AppleMacIntosh),</i> True Basic, Inc., Hanover, NH, (1987).<li>H. R. Lewis and C. H. Papadimitriou, <i>Elements of the Theory ofComputation</i>, Prentice-Hall, Englewood Cliffs, N. J. (1981).<li><i>Complexity results for classes of quantificational formulas,</i>J.Comput. Syst. Sci. \fB21,\fR 317 (1980).</ul></BODY></HTML>⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -