flâneur

Edsger Dijkstra's One-Day Workweek - Cal Newport

calnewport.com · 648 words · saved by 1 readers

Within my particular subfield of theoretical computer science there’s perhaps no individual more celebrated than Edsger Dijkstra. His career spanned half-a-century, beginning with a young Dijkstra formulating and solving the now classic shortest paths problem while working as a computer programmer at the Mathematical Center in Amsterdam, and ending with him as a renowned full professor holding a prestigious chair in the computer science department of the University of Texas at Austin. During this period, Dijkstra introduced some of the biggest ideas in distributed and concurrent computing, from semaphores and deadlock, to nondeterminacy and fairness. In 2003, the year after his death, the annual award given by the top conference in my field was renamed The Dijkstra Prize in his honor. This is all to say that I was intrigued when an alert reader recently pointed my attention to a fascinating observation about Dijkstra’s career. In 1973, fresh off winning a Turing Award, the highest priz

Within my particular subfield of theoretical computer science there’s perhaps no individual more celebrated than Edsger Dijkstra. His career spanned half-a-century, beginning with a young Dijkstra formulating and solving the now classic shortest paths problem while working as a computer programmer at the Mathematical Center in Amsterdam, and ending with him as a renowned full professor holding a prestigious chair in the computer science department of the University of Texas at Austin. During this period, Dijkstra introduced some of the biggest ideas in distributed and concurrent computin

related reading