Donald Knuth
Total Page:16
File Type:pdf, Size:1020Kb

Load more
Recommended publications
-
Donald Knuth Fletcher Jones Professor of Computer Science, Emeritus Curriculum Vitae Available Online
Donald Knuth Fletcher Jones Professor of Computer Science, Emeritus Curriculum Vitae available Online Bio BIO Donald Ervin Knuth is an American computer scientist, mathematician, and Professor Emeritus at Stanford University. He is the author of the multi-volume work The Art of Computer Programming and has been called the "father" of the analysis of algorithms. He contributed to the development of the rigorous analysis of the computational complexity of algorithms and systematized formal mathematical techniques for it. In the process he also popularized the asymptotic notation. In addition to fundamental contributions in several branches of theoretical computer science, Knuth is the creator of the TeX computer typesetting system, the related METAFONT font definition language and rendering system, and the Computer Modern family of typefaces. As a writer and scholar,[4] Knuth created the WEB and CWEB computer programming systems designed to encourage and facilitate literate programming, and designed the MIX/MMIX instruction set architectures. As a member of the academic and scientific community, Knuth is strongly opposed to the policy of granting software patents. He has expressed his disagreement directly to the patent offices of the United States and Europe. (via Wikipedia) ACADEMIC APPOINTMENTS • Professor Emeritus, Computer Science HONORS AND AWARDS • Grace Murray Hopper Award, ACM (1971) • Member, American Academy of Arts and Sciences (1973) • Turing Award, ACM (1974) • Lester R Ford Award, Mathematical Association of America (1975) • Member, National Academy of Sciences (1975) 5 OF 44 PROFESSIONAL EDUCATION • PhD, California Institute of Technology , Mathematics (1963) PATENTS • Donald Knuth, Stephen N Schiller. "United States Patent 5,305,118 Methods of controlling dot size in digital half toning with multi-cell threshold arrays", Adobe Systems, Apr 19, 1994 • Donald Knuth, LeRoy R Guck, Lawrence G Hanson. -
Tug2007-Slides-2X2.Pdf
Dedication ÅEÌ Professor Donald Knuth (Stanford) Extending TEX and Professor William Kahan (Berkeley) ÅEÌAFÇÆÌ with Floating-Point Arithmetic AF Nelson H. F. Beebe ÇÆÌ X and Department of Mathematics University of Utah E T Salt Lake City, UT 84112-0090 USA TEX Users Group Conference 2007 talk. – p. 1/30 TEX Users Group Conference 2007 talk. – p. 2/30 ÅEÌAFÇÆÌ Arithmetic in TEX and Arithmetic in ÅEÌAFÇÆÌ ÅEÌ ÅEÌ Binary integer arithmetic with 32 bits (T X \count ÅEÌAFÇÆÌ restricts input numbers to 12 integer bits: ≥ E registers) % mf expr Fixed-point arithmetic with sign bit, overflow bit, 14 gimme an expr: 4095 >> 4095 ≥ gimme an expr: 4096 integer bits, and 16 fractional bits (T X \dimen, E ! Enormous number has been reduced. \muskip, and \skip registers) AF >> 4095.99998 AF Overflow detected on division and multiplication but not gimme an expr: infinity >> 4095.99998 on addition (flaw (NHFB), feature (DEK)) gimme an expr: epsilon >> 0.00002 gimme an expr: 1/epsilon Gyrations sometimes needed in ÅEÌAFÇÆÌ to work ÇÆÌ ! Arithmetic overflow. ÇÆÌ Xwith and fixed-point numbers X and >> 32767.99998 Uh, oh.E A little while ago one of the quantities gimmeE an expr: 1/3 >> 0.33333 that I was computing got too large, so I’m afraid gimme an expr: 3*(1/3) >> 0.99998 T T your answers will be somewhat askew. You’ll gimme an expr: 1.2 • 2.3 >> •1.1 probably have to adopt different tactics next gimme an expr: 1.2 • 2.4 >> •1.2 time. But I shall try to carry on anyway. -
Typeset MMIX Programs with TEX Udo Wermuth Abstract a TEX Macro
TUGboat, Volume 35 (2014), No. 3 297 Typeset MMIX programs with TEX Example: In section 9 the lines \See also sec- tion 10." and \This code is used in section 24." are given. Udo Wermuth No such line appears in section 10 as it only ex- tends the replacement code of section 9. (Note that Abstract section 10 has in its headline the number 9.) In section 24 the reference to section 9 stands for all of ATEX macro package is presented as a literate pro- the eight code lines stated in sections 9 and 10. gram. It can be included in programs written in the If a section is not used in any other section then languages MMIX or MMIXAL without affecting the it is a root and during the extraction of the code a assembler. Such an instrumented file can be pro- file is created that has the name of the root. This file cessed by TEX to get nicely formatted output. Only collects all the code in the sequence of the referenced a new first line and a new last line must be entered. sections from the code part. The collection process And for each end-of-line comment a flag is set to for all root sections is called tangle. A second pro- indicate that the comment is written in TEX. cess is called weave. It outputs the documentation and the code parts as a TEX document. How to read the following program Example: The following program has only one The text that starts in the next chapter is a literate root that is defined in section 4 with the headline program [2, 1] written in a style similar to noweb [7]. -
The History of the Abel Prize and the Honorary Abel Prize the History of the Abel Prize
The History of the Abel Prize and the Honorary Abel Prize The History of the Abel Prize Arild Stubhaug On the bicentennial of Niels Henrik Abel’s birth in 2002, the Norwegian Govern- ment decided to establish a memorial fund of NOK 200 million. The chief purpose of the fund was to lay the financial groundwork for an annual international prize of NOK 6 million to one or more mathematicians for outstanding scientific work. The prize was awarded for the first time in 2003. That is the history in brief of the Abel Prize as we know it today. Behind this government decision to commemorate and honor the country’s great mathematician, however, lies a more than hundred year old wish and a short and intense period of activity. Volumes of Abel’s collected works were published in 1839 and 1881. The first was edited by Bernt Michael Holmboe (Abel’s teacher), the second by Sophus Lie and Ludvig Sylow. Both editions were paid for with public funds and published to honor the famous scientist. The first time that there was a discussion in a broader context about honoring Niels Henrik Abel’s memory, was at the meeting of Scan- dinavian natural scientists in Norway’s capital in 1886. These meetings of natural scientists, which were held alternately in each of the Scandinavian capitals (with the exception of the very first meeting in 1839, which took place in Gothenburg, Swe- den), were the most important fora for Scandinavian natural scientists. The meeting in 1886 in Oslo (called Christiania at the time) was the 13th in the series. -
Math Symbol Tables
APPENDIX A I Math symbol tables A.I Hebrew letters Type: Print: Type: Print: \aleph ~ \beth :J \daleth l \gimel J All symbols but \aleph need the amssymb package. 346 Appendix A A.2 Greek characters Type: Print: Type: Print: Type: Print: \alpha a \beta f3 \gamma 'Y \digamma F \delta b \epsilon E \varepsilon E \zeta ( \eta 'f/ \theta () \vartheta {) \iota ~ \kappa ,.. \varkappa x \lambda ,\ \mu /-l \nu v \xi ~ \pi 7r \varpi tv \rho p \varrho (} \sigma (J \varsigma <; \tau T \upsilon v \phi ¢ \varphi 'P \chi X \psi 'ljJ \omega w \digamma and \ varkappa require the amssymb package. Type: Print: Type: Print: \Gamma r \varGamma r \Delta L\ \varDelta L.\ \Theta e \varTheta e \Lambda A \varLambda A \Xi ~ \varXi ~ \Pi II \varPi II \Sigma 2: \varSigma E \Upsilon T \varUpsilon Y \Phi <I> \varPhi t[> \Psi III \varPsi 1ft \Omega n \varOmega D All symbols whose name begins with var need the amsmath package. Math symbol tables 347 A.3 Y1EX binary relations Type: Print: Type: Print: \in E \ni \leq < \geq >'" \11 « \gg \prec \succ \preceq \succeq \sim \cong \simeq \approx \equiv \doteq \subset c \supset \subseteq c \supseteq \sqsubseteq c \sqsupseteq \smile \frown \perp 1- \models F \mid I \parallel II \vdash f- \dashv -1 \propto <X \asymp \bowtie [Xl \sqsubset \sqsupset \Join The latter three symbols need the latexsym package. 348 Appendix A A.4 AMS binary relations Type: Print: Type: Print: \leqs1ant :::::; \geqs1ant ): \eqs1ant1ess :< \eqs1antgtr :::> \lesssim < \gtrsim > '" '" < > \lessapprox ~ \gtrapprox \approxeq ~ \lessdot <:: \gtrdot Y \111 «< \ggg »> \lessgtr S \gtr1ess Z < >- \lesseqgtr > \gtreq1ess < > < \gtreqq1ess \lesseqqgtr > < ~ \doteqdot --;- \eqcirc = .2.. -
RISC-V Instructioninstruction Setset
PortingPorting HelenOSHelenOS toto RISC-VRISC-V http://d3s.mff.cuni.cz Martin Děcký [email protected] CHARLES UNIVERSITY IN PRAGUE FacultyFaculty ofof MathematicsMathematics andand PhysicsPhysics IntroductionIntroduction Two system-level projects RISC-V is an instruction set architecture, HelenOS is an operating system Martin Děcký, FOSDEM, January 30th 2016 Porting HelenOS to RISC-V 2 IntroductionIntroduction Two system-level projects RISC-V is an instruction set architecture, HelenOS is an operating system Both originally started in academia But with real-world motivations and ambitions Both still in the process of maturing Some parts already fixed, other parts can be still affected Martin Děcký, FOSDEM, January 30th 2016 Porting HelenOS to RISC-V 3 IntroductionIntroduction Two system-level projects RISC-V is an instruction set architecture, HelenOS is an operating system Both originally started in academia But with real-world motivations and ambitions Both still in the process of maturing Some parts already fixed, other parts can be still affected → Mutual evaluation of fitness Martin Děcký, FOSDEM, January 30th 2016 Porting HelenOS to RISC-V 4 IntroductionIntroduction Martin Děcký Computer science researcher Operating systems Charles University in Prague Co-author of HelenOS (since 2004) Original author of the PowerPC port Martin Děcký, FOSDEM, January 30th 2016 Porting HelenOS to RISC-V 5 RISC-VRISC-V inin aa NutshellNutshell Free (libre) instruction set architecture BSD license, in development since 2014 Goal: No royalties for -
Implementation of a MIX Emulator: a Case Study of the Scala Programming Language Facilities
ISSN 2255-8691 (online) Applied Computer Systems ISSN 2255-8683 (print) December 2017, vol. 22, pp. 47–53 doi: 10.1515/acss-2017-0017 https://www.degruyter.com/view/j/acss Implementation of a MIX Emulator: A Case Study of the Scala Programming Language Facilities Ruslan Batdalov1, Oksana Ņikiforova2 1, 2 Riga Technical University, Latvia Abstract – Implementation of an emulator of MIX, a mythical synchronous manner, possible errors in a program may remain computer invented by Donald Knuth, is used as a case study of unnoticed. In the authors’ opinion, these checks are useful in the features of the Scala programming language. The developed mastering how to write correct programs because similar emulator provides rich opportunities for program debugging, such as tracking intermediate steps of program execution, an errors often occur in a modern program despite all changes in opportunity to run a program in the binary or the decimal mode hardware and software technologies. Therefore, it would be of MIX, verification of correct synchronisation of input/output helpful if an emulator supported running programs in different operations. Such Scala features as cross-compilation, family modes and allowed checking that the execution result was the polymorphism and support for immutable data structures have same in all cases. proved to be useful for implementation of the emulator. The The programming language chosen by the authors for the authors of the paper also propose some improvements to these features: flexible definition of family-polymorphic types, implementation of an emulator supporting these features is integration of family polymorphism with generics, establishing Scala. This choice is arbitrary to some extent and rather full equivalence between mutating operations on mutable data dictated by the authors’ interest in the features of this types and copy-and-modify operations on immutable data types. -
Processor Architectures
CS143 Handout 18 Summer 2008 30 July, 2008 Processor Architectures Handout written by Maggie Johnson and revised by Julie Zelenski. Architecture Vocabulary Let’s review a few relevant hardware definitions: register: a storage location directly on the CPU, used for temporary storage of small amounts of data during processing. memory: an array of randomly accessible memory bytes each identified by a unique address. Flat memory models, segmented memory models, and hybrid models exist which are distinguished by the way locations are referenced and potentially divided into sections. instruction set: the set of instructions that are interpreted directly in the hardware by the CPU. These instructions are encoded as bit strings in memory and are fetched and executed one by one by the processor. They perform primitive operations such as "add 2 to register i1", "store contents of o6 into memory location 0xFF32A228", etc. Instructions consist of an operation code (opcode) e.g., load, store, add, etc., and one or more operand addresses. CISC: Complex instruction set computer. Older processors fit into the CISC family, which means they have a large and fancy instruction set. In addition to a set of common operations, the instruction set has special purpose instructions that are designed for limited situations. CISC processors tend to have a slower clock cycle, but accomplish more in each cycle because of the sophisticated instructions. In writing an effective compiler back-end for a CISC processor, many issues revolve around recognizing how to make effective use of the specialized instructions. RISC: Reduced instruction set computer. Many modern processors are in the RISC family, which means they have a relatively lean instruction set, containing mostly simple, general-purpose instructions. -
Literate Programming and Reproducible Research
JSS Journal of Statistical Software January 2012, Volume 46, Issue 3. http://www.jstatsoft.org/ A Multi-Language Computing Environment for Literate Programming and Reproducible Research Eric Schulte Dan Davison University of New Mexico Counsyl Thomas Dye Carsten Dominik University of Hawai`i University of Amsterdam Abstract We present a new computing environment for authoring mixed natural and com- puter language documents. In this environment a single hierarchically-organized plain text source file may contain a variety of elements such as code in arbitrary program- ming languages, raw data, links to external resources, project management data, working notes, and text for publication. Code fragments may be executed in situ with graphical, numerical and textual output captured or linked in the file. Export to LATEX, HTML, LATEX beamer, DocBook and other formats permits working reports, presentations and manuscripts for publication to be generated from the file. In addition, functioning pure code files can be automatically extracted from the file. This environment is implemented as an extension to the Emacs text editor and provides a rich set of features for authoring both prose and code, as well as sophisticated project management capabilities. Keywords: literate programming, reproducible research, compendium, WEB, Emacs. 1. Introduction There are a variety of settings in which it is desirable to mix prose, code, data, and compu- tational results in a single document. Scientific research increasingly involves the use of computational tools. -
The Art of Computer Programming, Vol. 4A
THE ART OF COMPUTER PROGRAMMING Missing pages from select printings of Knuth, The Art of Computer Programming, Volume 4A (ISBN-13: 9780201038040 / ISBN-10: 0201038048). Copyright © 2011 Pearson Education, Inc. All rights reserved. DONALD E. KNUTH Stanford University 6 77 ADDISON–WESLEY Missing pages from select printings of Knuth, The Art of Computer Programming, Volume 4A (ISBN-13: 9780201038040 / ISBN-10: 0201038048). Copyright © 2011 Pearson Education, Inc. All rights reserved. Volume 4A / Combinatorial Algorithms, Part 1 THE ART OF COMPUTER PROGRAMMING Boston · Columbus · Indianapolis · New York · San Francisco Amsterdam · Cape Town · Dubai · London · Madrid · Milan Munich · Paris · Montréal · Toronto · Mexico City · São Paulo Delhi · Sydney · Hong Kong · Seoul · Singapore · Taipei · Tokyo Missing pages from select printings of Knuth, The Art of Computer Programming, Volume 4A (ISBN-13: 9780201038040 / ISBN-10: 0201038048). Copyright © 2011 Pearson Education, Inc. All rights reserved. The poem on page 437 is quoted from The Golden Gate by Vikram Seth (New York: Random House, 1986), copyright ⃝c 1986 by Vikram Seth. The author and publisher have taken care in the preparation of this book, but make no expressed or implied warranty of any kind and assume no responsibility for errors or omissions. No liability is assumed for incidental or consequential damages in connection with or arising out of the use of the information or programs contained herein. The publisher offers excellent discounts on this book when ordered in quantity forbulk purposes or special sales, which may include electronic versions and/or custom covers and content particular to your business, training goals, marketing focus, and branding interests. For more information, please contact: U.S. -
Rewriting the Bible in 0?
Technology Review - Rewriting the Bible in 0’s and 1’s Home Search Login Register My Profile Site Map Channels Infotech Biotech Nanotech Extra Rewriting the Bible in 0’s and 1’s September/October 1999 Inside By Steve Ditlea Magazine Forums Since the 1960s, Donald Knuth has been writing the sacred text of Newsletter computer programming. He’s a little behind schedule, but he has an excuse: he took time out to reinvent digitial typography. Scorecards Special Events Panel Series Nominate the When you write about Donald Next TR100! Knuth, it’s natural to sound scriptural. For nearly 40 years, the now-retired Stanford University professor has been writing the gospel of computer science, an epic Enter your email to called The Art of Computer receive our weekly Programming. The first three newsletter. volumes already constitute the Good Book for advanced software devotees, selling a million copies around the world in a dozen languages. His approach to code permeates the software culture. And lo, interrupting his calling for nine years, Donald Knuth wandered the wilderness of computer typography, creating a program that has become the Word in digital typesetting for scientific publishing. He called his software TeX, and offered it to all believers, rejecting the attempt by one tribe (Xerox) to assert ownership over its mathematical formulas. “Mathematics belongs to God,” he declared. But Knuth’s God is not above tricks on the faithful. In his TeX guide, The TeXbook, he writes that it “doesn’t always tell the truth” because the “technique of deliberate lying will actually make it easier for you to learn the ideas.” Now intent on completing his scriptures, the 61-year-old Knuth (ka- NOOTH) leads what he calls a hermit-like existence (with his wife) in the hills surrounding the university, having taken early retirement from teaching. -
Gnu Assembler
Using as The gnu Assembler (Sourcery G++ Lite 2010q1-188) Version 2.19.51 The Free Software Foundation Inc. thanks The Nice Computer Company of Australia for loaning Dean Elsner to write the first (Vax) version of as for Project gnu. The proprietors, management and staff of TNCCA thank FSF for distracting the boss while they gotsome work done. Dean Elsner, Jay Fenlason & friends Using as Edited by Cygnus Support Copyright c 1991, 92, 93, 94, 95, 96, 97, 98, 99, 2000, 2001, 2002, 2006, 2007, 2008, 2009 Free Software Foundation, Inc. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.3 or any later version published by the Free Software Foundation; with no Invariant Sections, with no Front-Cover Texts, and with no Back-Cover Texts. A copy of the license is included in the section entitled \GNU Free Documentation License". i Table of Contents 1 Overview :::::::::::::::::::::::::::::::::::::::: 1 1.1 Structure of this Manual :::::::::::::::::::::::::::::::::::::: 14 1.2 The GNU Assembler :::::::::::::::::::::::::::::::::::::::::: 15 1.3 Object File Formats::::::::::::::::::::::::::::::::::::::::::: 15 1.4 Command Line ::::::::::::::::::::::::::::::::::::::::::::::: 15 1.5 Input Files :::::::::::::::::::::::::::::::::::::::::::::::::::: 16 1.6 Output (Object) File:::::::::::::::::::::::::::::::::::::::::: 16 1.7 Error and Warning Messages :::::::::::::::::::::::::::::::::: 16 2 Command-Line Options::::::::::::::::::::::: 19 2.1 Enable Listings: `-a[cdghlns]'