Programmers have called parts of their program that don’t quite work ‘bugs’ for decades, but a programming legend believed that this term ...
Edsger Dijkstra, who has died of cancer aged 72, was a computer programming pioneer and penetrating thinker, who would throw off such remarks as: "The question of whether computers can think is like ...
In our Retrobituaries series, we highlight interesting people who are no longer with us. Today let's explore the life of Edsger Dijkstra, who died at 72 in 2002. If you’ve used a computer or smart ...
considered harmful: adj. [very common] Edsger W. Dijkstra’s note in the March 1968 “Communications of the ACM,” “Goto Statement Considered Harmful,” fired the first salvo in the structured programming ...
Over three years ago, I wrote a post to try to address a fallacy that is used to refute the idea of novel ways of teaching mathematics and science. That fallacy basically says that mathematics and the ...
Created by Dutch computer scientist Edsger Dijkstra in the 1950s, Dijkstra's Algorithm sets out to solve what is known in graph theory as a shortest path problem. What Dijkstra built would become the ...
A semaphore (pronounced as sehm uh fawr, invented by Edsger Dijkstra) in computer science is a classic way of protecting shared resources. A semaphore (pronounced as sehm uh fawr, invented by Edsger ...
If Spock would not think it illogical, it’s probably good code. Alexandre Buisse, CC BY-SA Legendary Dutch computer scientist Edsger W Dijkstra famously remarked that “testing shows the presence, not ...
When Edsger W. Dijkstra published his algorithm in 1959, computer networks were barely a thing. The algorithm in question found the shortest path between any two nodes on a graph, with a variant ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results