Giants in Computing
This course includes the works of some geniuses in the field of computer science and mathematics. One of greatest was Dijkstra who taught briefly at the University of Texas in Austin. Take some time to research Dijkstra and as always, include a summary along with an Internet URL and your name in the comments section of this blog.
Blog on!
13 Comments:
Mr. Edsgar Dijkstra born in Holland in 1931. He was one of the most reconized as one of the foremost computer minds in the world he recieved awards in several computer fields first and systems. additionally, he was was teacher at the highest levels of education including the University of Texas he created the Dijkstra Algorthm the Shortest path to problems was one of his last discoveries
http://en.wikipedia.org/wiki/Edsgar Dijkstra
C.J.
Edsger Wybe Dijkstra received the computing science's highest honor, the ACM Turing Award, among other awards, prizes, and recognitions.
http://www.cs.utexas.edu/users/EWD/
Teri Provorse
http://en.wikipedia.org/wiki/Dining_philosophers_problem#Dijkstra.27s_Solution
solution to dining philosopher's
albert
Edsgar Dijkstra made countless fundamental contrubutions in programing he sparked a great start in computer science untill his death in 2002.
http://en.wikipedia.org/wiki/Edsger_Dijkstra
Dijksrta was among the most influential minds ever in computer sciences. He made many domains to improve computers, including: algorithm design, programming languages, program design, and operating systems for just an example. He was also interested in teaching and relationships between academic computing science and the software industry.
The above comment is mine.
Shawn Speigner
Dijkstra sounds like a mathematical genius who helped improve program design around the world. I find it funny that he never used a computer much though.
Marcus Thomas
Edsger Dijkstra was born in 1931 in Holland. He was a Dutch computer scientist that was recognized as one of the foremost computer minds in the world and he also received many awards for his contributions. He was the chair of computer scientists at the University of Texas from 1984 till his death in 2002.
All i have been able to retain on this guy is that after he died he was awarded the AMC, and the PODC Influential paper award. all this was aquired at wikipedia web article site.
Jessie Cajigas
He's a pretty interesting guy. What I found most facinating was this quote from the program of a symposium dedicated to his work which says, "We have come to value good programs in much the same way as we value good literature."
It makes me wonder if one day the code programmers create will be praised at the same level as great literature, with programmers being treated as best-selling authors. It's not Hollywood, but it's a step up, and it'll make a programming job look more lucrative.
The entire program is listed here:
http://www.cs.utexas.edu/users/EWD/symposiumProgram.pdf
Joeshua Ladouceur
Its Great that he help the world with program design of the world and i do love math but this topic isnt suted for me
Edsger Wybe Dijkstra received many awards for his contributions in the Computer Science Field. Some of his contributions are: the shortest path algorithm,the THE multiprogramming system, semaphore construct, and the making of the subarea of Self-Stabilization. His essays and manuscripts facilitated the spread of knowledge and search in the Computer Science Field. He was an early pioneer of the research on distributed computing, which brings the question what is distributed computing and self-stabilization?
"Computer Science is no more about computers than Astronomy is about telescopes" Dijkstra
http://en.wikipedia.org/wiki/Edsger_Dijkstra
hector mojica
In 1956, Dijkstra came up with the "shortest-path algorithm", after he had been assigned the task of showing the powers of ARMAC, the computer that the Mathematical Centre had in it's possession; an algorithm which aids in finding the best way to travel between two points. He also used this to solve the problem of finding a way to "convey electricity to all essential circuits, while using as little expensive copper wire as possible" that the engineers that had designed the ARMAC ran into. He called it the "shortest subspanning tree algorithm."
jennifer
http://www.thocp.net/biographies/dijkstra_edsger.htm
Post a Comment
<< Home