Introduction to EWD

Edsger wybe Dijkstra was a principal contributor in the late 1950's to the development of the Algol, a high level programming language which has become a model of clarity and mathematical rigor. he is one of the principal exponents of the science and art of programming versions in general, and has greatly contributed to our understanding of their structure, representation, and implementation. his shortteen years of publications extend from theoretical articles on Graph Theory to basic manuals, expository texts, and philosophical contemplations in the field of programming languages.

When it comes to EWD, many people will think of Dijkstra algorithm, which is the shortest path, just like when it comes to Sir. Tony Hoare, just like quick sort. In fact, these algorithms are just the most trivial contribution of two cool people in their careers. For example, the Dijkstra algorithm is nothing more than the result of Grandpa Dai's first attempt to demonstrate the computing power of the new computer armac in 1956. According to Grandpa Dai, he did not even use paper or pen to develop the shortest path algorithm. At that time, he and his wife were sunning and drinking coffee on the balcony of a coffee shop in Amsterdam, and suddenly they came up with this algorithm. In addition, the algorithm research at that time was still primitive, and Niu people were busy using computers for numerical computation, so they did not care about discrete algorithms. At that time, there was no professional journal devoted to discrete algorithms. Grandpa Dai postponed the algorithm. It was not until 1959 that he posted the algorithm on the account of numerische mathematik, with the right to join. In many fields, EWD is an expert in both theory and programming. However, he has a lot of profound work. The old gentlemen of the school thought that undergraduates could not accept it and didn't talk to undergraduates.

Grandpa Dai became famous for the shortest path algorithm, so someone invited him to design another computer X1 and assigned him the task of designing a Real-Time Interrupt System. It seems that real-time interruption is nothing, but you must know that there is no real-time interruption concept before X1. Achieving it is a bet. Grandpa Dai was reluctant at first, but he couldn't wait for the rounds of Bram and Carel from the project owner. "We know that real-time interruptions make your work very difficult, but a cool man like you can say it. As a result, Grandpa Dai was thoroughly penetrated by sugar-coated shells and took over the hot potato. Two or three years later, he not only made real-time interruptions, but also wrote his own doctoral thesis around it and put on his doctor's hat.

The one that makes grandpa Dai really famous is the algo60 developed on X1, one of the earliest advanced languages. Grandpa Dai worked day and night for 8 months, and then he got algo60. He also won the Turing Award in 1972. Because of algo60, Grandpa Dai published a shocking article: recursive programming, so people know that the original advanced language can also implement recursion efficiently. Since then, all programmers are inevitably dealing with the stack, a word invented by grandpa Dai (should be said to be a concept. In addition, algo60 gave Grandpa Dai an in-depth consideration of the problem of multi-channel programming, and finally invented the concept that every system programmer could not go around: semaphore. Of course, Grandpa Dai always strictly formalizes the concepts he invented, and is a true scientist. Compared with these achievements, the philosophers he raised have nothing to say.

It was funny to say that Grandpa Dai was not trained in orthodox mathematics or specializes in numerical analysis, so he finally reluctantly gave him a teaching role. This kind of small setback does not prevent a cool man like Dai's from making history. While teaching numerical analysis, he began to develop a new operating system and train computer scientists. Several years later, the multiprogramming system was born. The is the first operating system that supports loose coupling and explicit synchronization, and thus makes it easy to prove that the system has no deadlocks. Unfortunately, Grandpa Dai was not knowledgeable about his role and forced to disband his research team (in 1972, Grandpa Dai told his department head that he had won the Turing Award, the first reaction of the head of the department is that you like to issue prize in computer games ). This made Grandpa Dai quite depressed and depressed. In extreme depression, Grandpa Dai decided to use his writing to treat his own depression. As a result, notes on structured programming was born. Grandpa Dai was honored as the founder of structured programming, and his depression was well cured.

EWD is too good, and there are too many stories. From 1973, his story happened in the United States.

In October 1930, Dijkstra was born in Rotterdam, the Netherlands. His father is a chemist and his mother is a mathematician.

He earned a master's degree in mathematics and theoretical physics at the University of Leyton and a doctorate in computer science at the University of Amsterdam.

From 1952 to 1962, he worked as a programmer at the Amsterdam mathematical center; from 1962 to 1984 he served as a professor of mathematics at the University of ahoofen.

From 1984 to 1999, he was a professor of computer science at the University of Texas in Austin.

Retired in 1999 as an honorary professor at the University of Texas.

Dijkstra put forward a famous opinion: algorithm logic is and must be the basis of all useful computer program structures. In addition, his famous points also include: constructing a * system as a clear synchronization sequence process, regularization of computer program development, and effective control of uncertainty in intellectual investment. The shortest path algorithm he invented has a high efficiency.

He also designed and implemented the first algo60 language compiler.

He is also the leader in abolishing "Goto statements.

Dijkstra is a high-yielding writer. Http://www.cs.utexas.edu /~ You can find more than 3000 pieces of EWD. He often communicates with hundreds of friends and colleagues-not by email, but by traditional letters. He insisted on using a pen, not a computer, whether writing an academic paper or writing a letter.

Dijkstra is widely known for his wise, eloquent, and insightful words. He said: "Can computers think? This is just like 'Whether a submarine can swim ."

When a young scientist asked him how to choose a research topic, he replied, "only do what you can do ." In his speech after the award of the Turing summit, he said: "as a tool, computers make our culture a simple wave, but that's all; as a challenge to human intelligence, the great wave of computer science has never been before in human history."

Dijkstra proposed many new concepts and terms, greatly enriching the language of computer science. His concepts include structured program design, problem breakdown, synchronization, deadlock, "Philosopher dinner", the weakest premise ...... And the famous "semaphores" used to control computer process synchronization ". The Oxford English Dictionary contains the words "vector" and "stack" he uses in the computer science environment.

In his scientific career, Dijkstra has always insisted on the brilliant academic festival, so that he will not be influenced by business, management, politics, and other factors. Simple, elegant, and persuasive. This is his style. In the field of programming and mathematics, his "Elegance" has always inspired thousands of people. He evaluated his work as "the highest standard" and encouraged his friends to do the same.

In addition, he took the role of Socrates-the ox-state. He once and again pointed out the mistakes in the fashion viewpoint, like the ox-pilot, which encouraged the country to keep moving forward, just like Socrates, his most important heritage is the incomplete research and Induction of half of the theory and incomplete exploration. All those who have discussed and worked with him, especially those who have attended the reading group (the famous Tuesday afternoon Club) He organized at Eindhoven and Austin, he has benefited a lot.

Dijkstra is the winner of the 1972 Turing Award, which is often referred to as the "Nobel Prize in the computer science field ".

He is an honorary member of the Royal Dutch Emy of Sciences and the National Emy of sciences.

He also received the Harry Goode Award from the US Information Processing Society Association (afips) in 1974.

In 1982, he received the computer Pioneer Award from the Institute of Electrical and Electronics Engineers (IEEE.

In 1989, he received the sigcse Award from the American Computer Society (ACM) for making outstanding contributions to computer science education.

The University of Economics of Athens granted him an honorary doctorate title in 2001.

In August 6, 2002, Professor edsger wybe Dijkstra of the computer science and engineering field resigned at his home in Nuenen, Netherlands, at the age of 72 years after years of struggle with cancer.

In 2002, the C & C Foundation in Japan evaluated Dijkstra as: "He has made pioneering research on the basic software theory, algorithm theory structure, and signal mechanism, it laid a solid foundation for computer science."

Let us borrow the words that he gave to Socrates: "We undoubtedly claim that he is the smartest, the most fair, and the best of all of us in the same age we know."

Edsger wybe Dijkstra has guided and will continue to guide all programmers on the planet. His contribution and impact will survive.