Information about Edsger Dijkstra

Edsger Wybe Dijkstra

Born	May 11 1930(1930--) Rotterdam, Netherlands
Died	July 6 2002 (aged 72) Nuenen, Netherlands
Field	Computer science
Institutions	Mathematisch Centrum The University of Texas at Austin
Known for	Dijkstra's algorithm THE multiprogramming system Semaphore
Notable prizes	Turing Award Association for Computing Machinery

Edsger Wybe Dijkstra (May 11, 1930 – August 6, 2002; IPA: ˈɛtˌsxər ˈwibə ˈdɛɪkˌstra) was a Dutch computer scientist. He received the 1972 A. C. M. Turing Award for fundamental contributions in the area of programming languages, and was the Schlumberger Centennial Chair of Computer Sciences at The University of Texas at Austin from 1984 until 2000.

Shortly before his death in 2002, he received the ACM PODC Influential Paper Award in distributed computing for his work in the subarea of self-stabilization. This annual award was renamed the Dijkstra Prize the following year, in his honour.

Life

Born in Rotterdam, Dijkstra studied theoretical physics at Leiden University, but he quickly realized he was more interested in computer science.

Originally employed by the Mathematisch Centrum in Amsterdam, he held a professorship at the Eindhoven University of Technology in the Netherlands, worked as a research fellow for Burroughs Corporation in the early 1970s, and later held the Schlumberger Centennial Chair in Computer Sciences at The University of Texas at Austin, in the United States. He retired in 2000.

Among his contributions to computer science is the shortest path-algorithm, also known as Dijkstra's algorithm, the THE multiprogramming system, and the semaphore construct, for coordinating multiple processors and programs. Another concept due to Dijkstra in the field of distributed computing is that of self-stabilization – an alternative way to ensure the reliability of the system. Dijkstra's algorithm is used in SPF, Shortest Path First, which is used in the routing protocol OSPF, Open Shortest Path First.

He was also known for his low opinion of the GOTO statement in computer programming, culminating in the 1968 article "A Case against the GO TO Statement" (EWD215), regarded as a major step towards the widespread deprecation of the GOTO statement and its effective replacement by structured control constructs such as the while loop. This methodology was also called structured programming. The paper's more famous title, "Go To Statement Considered Harmful", was not the work of Dijkstra, but of Niklaus Wirth, then editor of Communications of the ACM. Dijkstra was known to be a fan of ALGOL 60, and worked on the team that implemented the first compiler for that language. Dijkstra and Jaap Zonneveld, who collaborated on the compiler, agreed not to shave until the project was completed. Zonneveld eventually shaved off his beard; Dijkstra kept his until his death.

He also wrote two important papers in 1968, devoted to the structure of the multiprogramming systems and to cooperating sequential processes.

He is famed for coining the popular programming phrase "2 or more, use a for", alluding to the fact that when you find yourself processing more than one instance of a data structure, it is time to encapsulate that logic inside a loop.

From the 1970s, Dijkstra's chief interest was formal verification. The prevailing opinion at the time was that one should first write a program and then provide a mathematical proof of correctness. Dijkstra objected that the resulting proofs are long and cumbersome, and that the proof gives no insight as to how the program was developed. An alternative method is program derivation, to "develop proof and program hand in hand". One starts with a mathematical specification of what a program is supposed to do and applies mathematical transformations to the specification until it is turned into a program that can be executed. The resulting program is then known to be correct by construction. Much of Dijkstra's later work concerns ways to streamline mathematical argument. In a 2001 interview, he stated a desire for "elegance", whereby the correct approach would be to process thoughts mentally, rather than attempt to render them until they are complete. The analogy he made was to contrast the compositional approaches of Mozart and Beethoven.

Dijkstra was known for his essays on programming; he was the first to make the claim that programming is so inherently difficult and complex that programmers need to harness every trick and abstraction possible in hopes of managing the complexity of it successfully. He was also known for his habit of carefully composing manuscripts with his fountain pen. The manuscripts are called EWDs, since Dijkstra numbered them with EWD as prefix. Dijkstra would distribute photocopies of a new EWD among his colleagues; as many recipients photocopied and forwarded their copy, the EWDs spread throughout the international computer science community. The topics are mainly computer science and mathematics, but also include trip reports, letters, and speeches. More than 1300 EWDs have since been scanned, with a growing number also transcribed to facilitate search, and are available online at the Dijkstra archive of the University of Texas^[1].

Dijkstra was one of the very early pioneers of the research on distributed computing. Some people even consider some of his papers to be those that established the field. In particular, his paper "Self-stabilizing Systems in Spite of Distributed Control" started the sub-field of self-stabilization.

Dijkstra was also noted for owning only one computer (late in life) and rarely actually using them, in keeping with his conviction that computer science was more abstract than mere programming, expressed in a number of famous sayings such as "Computer Science is no more about computers than astronomy is about telescopes". Almost all articles in this series appearing after 1972 are hand-written. Having invented much of the technology of software, Dijkstra eschewed the use of computers in his own work for many decades. Even after he succumbed to his UT colleagues’ encouragement and acquired a Macintosh computer, he used it only for e-mail and for browsing the World Wide Web.^[2]

He died in Nuenen, The Netherlands on August 6 2002 after a long struggle with cancer. The following year, the ACM (Association for Computing Machinery) PODC Influential Paper Award in distributed computing was renamed the Dijkstra Prize in his honour.

Trivia

Andrzej Sapkowski, Polish fantasy writer, used Dijkstra's name for one of the main characters in the five book "Saga" about The Hexer.

See also

• Dijkstra's algorithm
• Dining philosophers problem
• "The Cruelty of Really Teaching Computer Science"
• Shunting yard algorithm

Footnotes

References

Writings by E.W. Dijkstra

• Go To Statement Considered Harmful], Communications of the ACM, Vol. 11 (1968) 147–48 (EWD215)
• How do we tell truths that might hurt? (EWD498)
• From My Life (EWD1166)
• A Discipline of Programming, Prentice-Hall Series in Automatic Computation, 1976, ISBN 0-13-215871-X
• Selected Writings on Computing: A Personal Perspective, Texts and Monographs in Computer Science, Springer-Verlag, 1982, ISBN 0-387-90652-5
• A Method of Programming, E.W. Dijkstra, W.H.J. Feijen, J. Sterringa, Addison Wesley 1988, ISBN 0-201-17536-3

Others about Dijkstra, eulogies

• Biography Digidome
• Edsger Wybe Dijkstra (1930–2002): A Portrait of a Genius (PDF) Obituary in Formal Aspects of Computing with a short biography
• How can we explain Edsger W. Dijkstra to those who didn't know him? by David Gries
• Dijkstra Eulogy by J Strother Moore
• In Memoriam Edsger Wybe Dijkstra by Mario Szegedy
• Photos of Edsger Dijkstra

External links

• E. W. Dijkstra Archive
• Noorderlicht Interview Video, bandwidth options

•  • [ e] A.M. Turing Award Laureates

Perlis (1966) • Wilkes (1967) • Hamming (1968) • Minsky (1969) • Wilkinson (1970) • McCarthy (1971) • Dijkstra (1972) • Bachman (1973) • Knuth (1974) • Newell / Simon (1975) • Rabin / Scott (1976) • Backus (1977) • Floyd (1978) • Iverson (1979) • Hoare (1980) • Codd (1981) • Cook (1982) • Thompson / Ritchie (1983) • Wirth (1984) • Karp (1985) • Hopcroft / Tarjan (1986) • Cocke (1987) • Sutherland (1988) • Kahan (1989) • Corbat (1990) • Milner (1991) • Lampson (1992) • Hartmanis / Stearns (1993) • Feigenbaum / Reddy (1994) • Blum (1995) • Pnueli (1996) • Engelbart (1997) • Gray (1998) • Brooks (1999) • Yao (2000) • Dahl / Nygaard (2001) • Rivest / Shamir / Adleman (2002) • Kay (2003) • Cerf / Kahn (2004) • Naur (2005) • Allen (2006)

Persondata
NAME	Dijkstra, Edsger
ALTERNATIVE NAMES
SHORT DESCRIPTION	Dutch mathematician
DATE OF BIRTH	May 11 1930(1930--)
PLACE OF BIRTH	Rotterdam
DATE OF DEATH	July 6 2002
PLACE OF DEATH	Nuenen, The Netherlands