Authors Scientist Edsger Dijkstra

Edsger Dijkstra

Dutch computer scientist · 1930–2002

Computer scientist whose work on algorithms, structured programming and mathematical verification helped shape modern computing.

Lifetime
May 11, 1930 – Aug 6, 2002 (age 72)
Primary field
Secondary fields
Collaborator and co-author
External link

Edsger Wybe Dijkstra was a Dutch computer scientist born in Rotterdam. He studied mathematics and theoretical physics at Leiden University and worked as a programmer at Amsterdam’s Mathematical Centre. In 1959, he published his algorithm for finding the shortest paths through a network.

He helped establish structured programming and the use of mathematical proofs to show that programs behave as intended. His research also addressed how computer processes coordinate their work, including the introduction of semaphores. His 1968 letter criticising the unrestricted use of the go-to statement became a widely discussed contribution to programming practice.

Dijkstra became a professor at Eindhoven University of Technology in 1962 and joined the University of Texas at Austin in 1984. He received the Turing Award in 1972 for his contributions to programming. He retired in 1999 and died in the Netherlands in 2002.

Quotations

Selected works

Technical report · 1969
Notes on Structured Programming

An account of how structured program design, mathematical reasoning and progressive refinement can make software easier to understand, verify and modify.

Essay · 1975
How Do We Tell Truths That Might Hurt?

A critique of programming languages, professional habits and computing education, questioning whether avoiding uncomfortable conclusions undermines the integrity of computer science.

Position paper · 1983
On IPWs: A position paper for a panel discussion on Computers and Society

A critique of exaggerated claims about computers, advocating sceptical public understanding and questioning whether automation necessarily improves human activities.

Essay · 1984
On the Nature of Computing Science

An argument for computing science as a formal mathematical discipline, centred on effective reasoning, simplicity and elegance.

Keynote address · 1984
The Threats to Computing Science

A critique of commercial pressures, technological hype and educational shortcomings that divert computing science from simplicity, precision and disciplined reasoning.

Advice · c. 1989
Advice to a Young Scientist

A set of principles for young researchers on intellectual ambition, scientific integrity, simplicity, long-term thinking and the purpose of academic work.

Conference paper · 1992
On the Economy of doing Mathematics

An argument for more economical mathematical reasoning through effective notation, formal calculation, abstraction and the systematic removal of unnecessary complexity.

Address · 1994
The Strengths of the Academic Enterprise

A defence of academic independence, openness and long-term inquiry, questioning commercial influence and pressure for closer university-industry collaboration.

Course description · 1996
Elegance and Effective Reasoning

A course outline presenting elegance as practical simplicity and examining how it supports effective reasoning, design and problem selection.

✓Copied