@prefix rdf: . @prefix owl: . rdf:type owl:Thing . @prefix ns2: . rdf:type ns2:FellowsOfTheAssociationForComputingMachinery . @prefix dbpedia-owl: . rdf:type dbpedia-owl:Person , ns2:LeidenUniversityAlumni , ns2:Person100007846 , ns2:DutchPhysicists , ns2:PeopleFromRotterdam , ns2:ProgrammingLanguageResearchers , ns2:TuringAwardLaureates , dbpedia-owl:Scientist , ns2:Scientist110560637 , ns2:DutchComputerScientists , ns2:FormalMethodsPeople , ns2:ProgrammingLanguageDesigners , ns2:ComputerPioneers . @prefix dbpprop: . dbpprop:name "Dijkstra, Edsger"@en , "Edsger Wybe Dijkstra"@en . @prefix xsd: . @prefix ns6: . ns6:birthDate "1930-05-11"^^xsd:date . @prefix dbpedia: . ns6:birthPlace dbpedia:Rotterdam , dbpedia:Netherlands ; ns6:deathDate "2002-08-06"^^xsd:date ; ns6:deathPlace dbpedia:Nuenen , dbpedia:Netherlands . @prefix ns8: . ns8:doctoralAdvisor dbpedia:Adriaan_van_Wijngaarden ; ns8:doctoralStudent dbpedia:Antonetta_van_Gasteren , , dbpedia:Nico_Habermann , dbpedia:Cornelis_Hemerik , dbpedia:David_Naumann , dbpedia:Jan_Tijmen_Udding , dbpedia:Martin_Rem ; owl:sameAs , . @prefix foaf: . foaf:name "Edsger Wybe Dijkstra" ; foaf:page ; dbpedia-owl:knownFor , dbpedia:Structured_programming , , dbpedia:THE_multiprogramming_system ; ns6:knownFor , dbpedia:Structured_programming , , dbpedia:THE_multiprogramming_system ; dbpedia-owl:doctoralAdvisor dbpedia:Adriaan_van_Wijngaarden ; dbpedia-owl:doctoralStudent dbpedia:Nico_Habermann , , dbpedia:Cornelis_Hemerik , dbpedia:Antonetta_van_Gasteren , dbpedia:David_Naumann , dbpedia:Jan_Tijmen_Udding , dbpedia:Martin_Rem ; dbpprop:reference , , , , . @prefix rdfs: . rdfs:label "\u0415\u0434\u0441\u0433\u0435\u0440 \u0414\u0435\u0439\u043A\u0441\u0442\u0440\u0430"@uk , "Edsger Dijkstra"@sv , "Edsger Dijkstra"@it , "Edsger Dijkstra"@pt , "Edsger Dijkstra"@tr , "Edsger Dijkstra"@ro , "Edsger Dijkstra"@fi , "Edsger Wybe Dijkstra"@hu , "Edsger Dijkstra"@fr , "Edsger Dijkstra"@no , "Edsger Dijkstra"@cs , "Edsger Dijkstra"@pl , "Edsger Dijkstra"@es , "\u0414\u0435\u0439\u043A\u0441\u0442\u0440\u0430, \u042D\u0434\u0441\u0433\u0435\u0440 \u0412\u0438\u0431\u0435"@ru , "Edsger Dijkstra"@nl , "Edsger W. Dijkstra"@en , "\u30A8\u30C9\u30AC\u30FC\u30FB\u30C0\u30A4\u30AF\u30B9\u30C8\u30E9"@ja , "\u827E\u5179\u683C\u00B7\u8FEA\u6770\u65AF\u7279\u62C9"@zh , "Edsger Dijkstra"@ca , "Edsger Wybe Dijkstra"@de ; dbpedia-owl:thumbnail ; dbpedia-owl:birthDate "1930-05-11"^^xsd:date ; dbpedia-owl:birthPlace dbpedia:Rotterdam , dbpedia:Netherlands ; dbpedia-owl:deathDate "2002-08-06"^^xsd:date ; dbpedia-owl:deathPlace dbpedia:Nuenen , dbpedia:Netherlands ; dbpprop:abstract "F\u00E1jl:Edsger Wybe Dijkstra. jpg Edsger Wybe Dijkstra Edsger Wybe Dijkstra [\u02C8\u025Bt\u02CCsx\u0259r \u02C8d\u025B\u026Ak\u02CCstra] holland matematikus, informatikus."@hu , "Edsger Wybe Dijkstra was a Dutch computer scientist. He received the 1972 Turing Award for fundamental contributions to developing programming languages, and was the Schlumberger Centennial Chair of Computer Sciences at The University of Texas at Austin from 1984 until 2000. Shortly before his death in 2002, he received the ACM PODC Influential Paper Award in distributed computing for his work in the sub-topic of self-stabilization of program computation. This annual award was renamed the Dijkstra Prize the following year, in his honour."@en , "Edsger Wybe Dijkstra a fost un informatician olandez. Numele s\u0103u se pronun\u0163\u0103 aproximativ 'eds-h\u0103r 'deyk-stra. \u015Ei-a luat licen\u0163a \u00EEn fizic\u0103 teoretic\u0103 la Universitatea din Leiden. Dup\u0103 o perioad\u0103 de lucru ca cercet\u0103tor la Burroughs Corporation, a lucrat la Universitatea Tehnic\u0103 din Eindhoven \u015Fi mai apoi la Universitatea din Austin, Texas, de unde s-a retras \u00EEn 2000. Dijkstra a r\u0103mas celebru pentru algoritmul drumului minim \u00EEntr-un graf, algoritm care-i poart\u0103 numele. De asemenea, \u00EEntr-un articol celebru din 1968, a luat atitudine \u00EEmpotriva folosirii instruc\u0163iunii GOTO, consider\u00EEnd-o \"d\u0103un\u0103toare\"."@ro , "Edsger Wybe Dijkstra est un math\u00E9maticien et informaticien n\u00E9erlandais du XX si\u00E8cle."@fr , "Edsger Wybe Dijkstra Hollandal\u0131 matematik\u00E7i ve bilgisayarc\u0131."@tr , "Edsger Wybe Dijkstra [\u02C8\u025Bt\u02CCsx\u0259r \u02C8d\u025B\u026Ak\u02CCstra] war ein niederl\u00E4ndischer Informatiker. Er war der Wegbereiter der strukturierten Programmierung."@de , "Edsger Wybe Dijkstra [\u02C8\u025Bt\u02CCsx\u0259r \u02C8d\u025B\u026Ak\u02CCstra] IPA byl nizozemsk\u00FD informatik. V roce 1972 obdr\u017Eel Turingovu cenu za sv\u00E9 p\u0159\u00EDsp\u011Bvky rozvoji programovac\u00EDch jazyk\u016F."@cs , "Edsger Wybe Dijkstra - holenderski naukowiec, pionier informatyki. Informatyk\u0105 zajmowa\u0142 si\u0119 g\u0142\u00F3wnie od strony teoretycznej. Zajmowa\u0142 si\u0119 r\u00F3\u017Cnymi jej aspektami, mi\u0119dzy innymi algorytmik\u0105, j\u0119zykami programowania, formaln\u0105 specyfikacj\u0105 i weryfikacj\u0105."@pl , "Edsger Wybe Dijkstra fue un cient\u00EDfico de la computaci\u00F3n de origen holand\u00E9s."@es , "I suoi pi\u00F9 importanti contributi all'informatica sono stati il cosiddetto algoritmo di Dijkstra e il concetto di semaforo. \u00C8 anche noto per la pessima opinione espressa a proposito dell'uso dell'istruzione GOTO nella programmazione, culminata nel celebre articolo del 1968 Go To Statement Considered Harmful, considerato come uno dei passi fondamentali verso il rifiuto generalizzato dell'istruzione GOTO nei linguaggi di programmazione e della sua sostituzione con pi\u00F9 funzionali strutture di controllo come il ciclo while. Il celebre titolo dell'articolo non \u00E8 di Dijkstra, ma di Niklaus Wirth, allora curatore di Communications of the ACM. Dijkstra era noto per essere un fan dell'ALGOL 60, e lavor\u00F2 nel gruppo che realizz\u00F2 il primo compilatore per questo linguaggio. Dijkstra e Jaap Zonneveld, che collabor\u00F2 alla realizzazione del compilatore, si accordarono sul fatto di non radersi fino alla conclusione del progetto. Alla fine Zonneveld si tagli\u00F2 la lunga barba, mentre Dijkstra prefer\u00EC mantenerla fino alla fine dei suoi giorni. Sin dal 1970, l'interesse principale di Dijkstra fu la verifica formale (formal verification). A quel tempo l'opinione prevalente era che bisognasse scrivere prima il programma e solo in seguito fornire una dimostrazione matematica di correttezza formale. Dijkstra obiett\u00F2 che le dimostrazioni cos\u00EC prodotte erano lunghe ed illeggibili, e che non fornivano nessuna informazione sul modo in cui il programma era stato sviluppato. Il metodo alternativo proposto da Dijkstra fu il cosiddetto program derivation, consistente nello sviluppare in modo parallelo il programma e la dimostrazione. Secondo le parole di Dijkstra: \"develop proof and program hand in hand\". Partendo da una descrizione matematica di quello che il programma dovrebbe fare, si applicano le opportune trasformazioni matematiche in modo da trasformare la descrizione matematica iniziale in un programma eseguibile. Il programma risultante viene definito come: correct by construction (corretto per costruzione). Si occup\u00F2 anche di sistemi operativi, sviluppando il concetto di semaforo, implementandolo nel sistema operativo THEOS, e formulando il famoso problema di sincronizzazione detto problema dei cinque filosofi a cena. Gran parte del lavoro successivo di Dijkstra riguarda i modi per snellire le argomentazioni matematiche. In una intervista del 2001 dichiar\u00F2 un desiderio di \"eleganza\", dove l'approccio corretto consiste nell'elaborare i pensieri mentalmente, senza tentare di comunicarli finch\u00E9 non sono completi. L'analogia che fece era in contrasto con l'approccio compositivo di Mozart e Beethoven. Dijkstra era noto per le sue candide opinioni sulla programmazione, e per la sua abitudine di comporre attentamente dei manoscritti con la sua penna stilografica. Molti dei suoi appunti sono stati scansionati e sono disponibili online."@it , "Edsger Wybe Dijkstra var en nederlandsk fysiker og informatiker. Han var med p\u00E5 \u00E5 grunnlegge informatikk som vitenskap. I 1945 begynte Edsger Dijkstra p\u00E5 Universitetet i Leiden, der han studerte teoretisk fysikk. Sommeren 1951 l\u00E6rte han seg programmering p\u00E5 et sommerkurs. Han begynte \u00E5 arbeide deltid for Det matematiske senter i Amsterdam i mars 1952, noe som gjorde ham enda mer interessert i programmering. Edsger tok sin grad i fysikk s\u00E5 raskt som mulig, og konsentrerte seg deretter om programmeringen. I 1973 fikk Edsger Dijkstra en forskerstilling ved Burroughs Corporation i USA. Han mottok Turingprisen i 1972. Han flyttet til Austin i Texas i 1984. Samme \u00E5r fikk han en stilling p\u00E5 universitetet i Austin i informatikkavdelingen. Denne stillingen beholdt han inntil han gikk av med pensjon i 2000."@no , "Edsger Wybe Dijkstra; Fou un inform\u00E0tic holand\u00E8s . Va rebre el 1972 el Premi Turing per les contribucions fonamentals en l'\u00E0rea dels llenguatges de programaci\u00F3, i va ser el \"Schlumberger Centennial Chair of Computer Sciences\" a la Universitat de Texas a Austin des de 1984 fins la seva mort el 2002."@ca , "Edsger Wybe Dijkstra foi um cientista da computa\u00E7\u00E3o neerland\u00EAs conhecido por suas contribui\u00E7\u00F5es nas \u00E1reas de desenvolvimento de algoritmos e programas, de linguagens de programa\u00E7\u00E3o (pelo qual recebeu o Turing Award de 1972 por suas contribui\u00E7\u00F5es fundamentais), sistemas operacionais e processamento distribu\u00EDdo. A pron\u00FAncia aproximada em portugu\u00EAs para Edsger Dijkstra \u00E9 \u00E9tsrrar d\u00E9ikstra. Entre suas contribui\u00E7\u00F5es para a ci\u00EAncia da computa\u00E7\u00E3o est\u00E1 inclu\u00EDdo o algoritmo para o problema do caminho m\u00EDnimo (tamb\u00E9m conhecido como algoritmo de Dijkstra), o sistema operacional THE e a constru\u00E7\u00E3o de sem\u00E1foros para coordenar m\u00FAltiplos processadores e programas. Outro conceito desenvolvido pelo cientista foi a auto-estabiliza\u00E7\u00E3o na \u00E1rea de sistemas distribu\u00EDdos, uma forma alternativa de garantir a confian\u00E7a de um sistema. O cientista tamb\u00E9m foi conhecido por seus ensaios sobre programa\u00E7\u00E3o, tendo sido o primeiro a alegar que programa\u00E7\u00E3o \u00E9 t\u00E3o inerentemente dif\u00EDcil e complexa que os programadores precisam realizar qualquer abstra\u00E7\u00E3o poss\u00EDvel para gerenciar a complexidade com sucesso."@pt , "\u30A8\u30C9\u30AC\u30FC\u30FB\u30C0\u30A4\u30AF\u30B9\u30C8\u30E9\uFF08Edsger Wybe Dijkstra, 1930\u5E745\u670811\u65E5 - 2002\u5E748\u67086\u65E5\uFF09\u306F\u3001\u30AA\u30E9\u30F3\u30C0\u4EBA\u306E\u60C5\u5831\u5DE5\u5B66\u8005\u30021972\u5E74\u3001\u30D7\u30ED\u30B0\u30E9\u30DF\u30F3\u30B0\u8A00\u8A9E\u306E\u57FA\u790E\u7814\u7A76\u306B\u5BFE\u3057\u3066\u30C1\u30E5\u30FC\u30EA\u30F3\u30B0\u8CDE\u3092\u53D7\u8CDE\u3002\u69CB\u9020\u5316\u30D7\u30ED\u30B0\u30E9\u30DF\u30F3\u30B0\u306E\u63D0\u5531\u8005\u30021984\u5E74\u304B\u30892002\u5E74\u306B\u4EA1\u304F\u306A\u308B\u307E\u3067\u30C6\u30AD\u30B5\u30B9\u5927\u5B66\u30AA\u30FC\u30B9\u30C6\u30A3\u30F3\u6821\u306E\u60C5\u5831\u5DE5\u5B66\u306E Schlumberger Centennial Chair \u3092\u52D9\u3081\u305F\u3002 \u30A8\u30BA\u30AC\u30FC\u30FB\u30C0\u30A4\u30AF\u30B9\u30C8\u30E9\u3068\u8868\u8A18\u3055\u308C\u308B\u3053\u3068\u3082\u3042\u308B\u3002\u30AA\u30E9\u30F3\u30C0\u8A9E\u3067\u306E\u767A\u97F3\u306F\u3001IPA\u8868\u8A18\u3067\u02C8\u025Btsx\u0259r \u02C8wib\u0259 \u02C8d\u025B\u026Akstra\u3067\u3001\u30A8\u30C4\u30CF\u30FC\u30FB\u30A6\u30A3\u30D9\u30FB\u30C7\u30A4\u30AF\u30B9\u30C8\u30E9\u306B\u8FD1\u3044\u3002"@ja , "Edsger Wybe Dijkstra oli hollantilainen tietojenk\u00E4sittelyteoreetikko. Dijkstra opiskeli teoreettista fysiikkaa Leidenin yliopistolla. H\u00E4n ty\u00F6skenteli tutkijana Burroughs Corporationille 1970-luvun alussa. H\u00E4n ty\u00F6skenteli Eindhovenin yliopistolla Alankomaissa ja vuodesta 1984 University of Texas at Austinissa Yhdysvalloissa. Dijkstra j\u00E4i el\u00E4kkeelle vuoden 1999 marraskuussa. H\u00E4nen tunnetuin saavutuksensa lienee Dijkstran algoritmina tunnettu graafialgoritmi. Dijkstra k\u00E4ytti my\u00F6s ensimm\u00E4ist\u00E4 kertaa esimerkki\u00E4 \"aterioivista filosofeista\" esimerkkin\u00E4 synkronoimisongelmasta vuonna 1965. Vuonna 1968 h\u00E4n johti ryhm\u00E4\u00E4, joka toteutti THE-moniajok\u00E4ytt\u00F6j\u00E4rjestelm\u00E4n. Turing-palkinnon h\u00E4n sai 1972. Dijkstra oli mukana ryhm\u00E4ss\u00E4, joka toteutti ensimm\u00E4isen ALGOL 60 -k\u00E4\u00E4nt\u00E4j\u00E4n. H\u00E4nen kantansa GOTO-k\u00E4skyst\u00E4 on sittemmin muodostunut klassikoksi, tosin sen otsikon \"Go To Statement Considered Harmful\" keksi Niklaus Wirth. 1970-luvulta l\u00E4htien Dijkstran tutkimus keskittyi ohjelmien formaaliin verifiointiin, ohjelman oikeellisuuden todentamiseen formaaleilla menetelmill\u00E4. Dijkstra kuoli sy\u00F6p\u00E4\u00E4n 6. elokuuta 2002 pitk\u00E4llisen sairauden j\u00E4lkeen."@fi , "\u0424\u0430\u0439\u043B:Edsger Wybe Dijkstra. jpg \u042D\u0434\u0441\u0433\u0435\u0440 \u0412\u0438\u0431\u0435 \u0414\u0435\u0439\u043A\u0441\u0442\u0440\u0430 \u042D\u0301\u0434\u0441\u0433\u0435\u0440 \u0412\u0438\u0301\u0431\u0435 \u0414\u0435\u0301\u0439\u043A\u0441\u0442\u0440\u0430\u00A0\u2014 \u0432\u044B\u0434\u0430\u044E\u0449\u0438\u0439\u0441\u044F \u043D\u0438\u0434\u0435\u0440\u043B\u0430\u043D\u0434\u0441\u043A\u0438\u0439 \u0443\u0447\u0451\u043D\u044B\u0439, \u0438\u0434\u0435\u0438 \u043A\u043E\u0442\u043E\u0440\u043E\u0433\u043E \u043E\u043A\u0430\u0437\u0430\u043B\u0438 \u043E\u0433\u0440\u043E\u043C\u043D\u043E\u0435 \u0432\u043B\u0438\u044F\u043D\u0438\u0435 \u043D\u0430 \u0440\u0430\u0437\u0432\u0438\u0442\u0438\u0435 \u043A\u043E\u043C\u043F\u044C\u044E\u0442\u0435\u0440\u043D\u043E\u0439 \u0438\u043D\u0434\u0443\u0441\u0442\u0440\u0438\u0438."@ru , "\u0424\u0430\u0439\u043B:Edsger Wybe Dijkstra. jpg \u0415\u0434\u0441\u0433\u0430\u0440 \u0412\u0456\u0431\u0435 \u0414\u0435\u0439\u043A\u0441\u0442\u0440\u0430 \u0415\u0301\u0434\u0441\u0433\u0435\u0440 \u0412\u0456\u0301\u0431\u0435 \u0414\u0435\u0301\u0439\u043A\u0441\u0442\u0440\u0430 \u2014 \u043D\u0456\u0434\u0435\u0440\u043B\u0430\u043D\u0434\u0441\u044C\u043A\u0438\u0439 \u043D\u0430\u0443\u043A\u043E\u0432\u0435\u0446\u044C \u0443 \u0433\u0430\u043B\u0443\u0437\u0456 \u043A\u043E\u043C\u043F'\u044E\u0442\u0435\u0440\u043D\u0438\u0445 \u043D\u0430\u0443\u043A. \u0423 1972 \u0440\u043E\u0446\u0456 \u0431\u0443\u0432 \u0432\u0456\u0434\u0437\u043D\u0430\u0447\u0435\u043D\u0438\u0439 \u043F\u0440\u0435\u043C\u0456\u0454\u044E \u0422\u044E\u0440\u0456\u043D\u0433\u0430 \u0437\u0430 \u0432\u0430\u0433\u043E\u043C\u0438\u0439 \u0432\u043D\u0435\u0441\u043E\u043A \u0443 \u0440\u043E\u0437\u0432\u0438\u0442\u043E\u043A \u043C\u043E\u0432 \u043F\u0440\u043E\u0433\u0440\u0430\u043C\u0443\u0432\u0430\u043D\u043D\u044F. \u0411\u0430\u0442\u044C\u043A\u043E \u0415\u0434\u0441\u0433\u0435\u0440\u0430 \u0414\u0435\u0439\u043A\u0441\u0442\u0440\u0438 \u0431\u0443\u0432 \u0445\u0456\u043C\u0456\u043A\u043E\u043C, \u0430 \u043C\u0430\u0442\u0438 \u2014 \u043C\u0430\u0442\u0435\u043C\u0430\u0442\u0438\u043A\u043E\u043C. \u0415\u0434\u0441\u0433\u0435\u0440 \u0432\u0438\u0432\u0447\u0430\u0432 \u0443 \u041B\u0435\u0439\u0434\u0435\u043D\u0441\u044C\u043A\u043E\u043C\u0443 \u0443\u043D\u0456\u0432\u0435\u0440\u0441\u0438\u0442\u0435\u0442\u0456 \u0442\u0435\u043E\u0440\u0435\u0442\u0438\u0447\u043D\u0443 \u0444\u0456\u0437\u0438\u043A\u0443, \u0442\u0430 \u0437\u0433\u043E\u0434\u043E\u043C \u0443\u0441\u0432\u0456\u0434\u043E\u043C\u0438\u0432, \u0449\u043E \u0431\u0456\u043B\u044C\u0448\u0435 \u0437\u0430\u0446\u0456\u043A\u0430\u0432\u043B\u0435\u043D\u0438\u0439 \u043A\u043E\u043C\u043F'\u044E\u0442\u0435\u0440\u043D\u0438\u043C\u0438 \u043D\u0430\u0443\u043A\u0430\u043C\u0438. \u0414\u0435\u0439\u043A\u0441\u0442\u0440\u0430 \u043F\u0440\u0438\u0439\u043C\u0430\u0432 \u0430\u043A\u0442\u0438\u0432\u043D\u0443 \u0443\u0447\u0430\u0441\u0442\u044C \u0443 \u0440\u043E\u0437\u0440\u043E\u0431\u0446\u0456 \u043C\u043E\u0432\u0438 \u043F\u0440\u043E\u0433\u0440\u0430\u043C\u0443\u0432\u0430\u043D\u043D\u044F \u0410\u041B\u0413\u041E\u041B, \u043D\u0438\u043C \u0431\u0443\u0432 \u043D\u0430\u043F\u0438\u0441\u0430\u043D\u0438\u0439 \u043F\u0435\u0440\u0448\u0438\u0439 \u043A\u043E\u043C\u043F\u0456\u043B\u044F\u0442\u043E\u0440 \u0434\u043B\u044F \u0410\u041B\u0413\u041E\u041B-60. \u0423 \u0441\u0432\u043E\u0457\u0439 \u0434\u0456\u044F\u043B\u044C\u043D\u043E\u0441\u0442\u0456 \u043F\u043E \u0440\u043E\u0437\u0432\u0438\u0442\u043A\u0443 \u043A\u043E\u043D\u0446\u0435\u043F\u0446\u0456\u0457 \u0441\u0442\u0440\u0443\u043A\u0442\u0443\u0440\u043D\u043E\u0433\u043E \u043F\u0440\u043E\u0433\u0440\u0430\u043C\u0443\u0432\u0430\u043D\u043D\u044F \u0430\u043A\u0442\u0438\u0432\u043D\u043E \u0432\u0438\u0441\u0442\u0443\u043F\u0430\u0432 \u0437\u0430 \u0432\u0456\u0434\u043C\u043E\u0432\u0443 \u0432\u0456\u0434 goto. \u0428\u0438\u0440\u043E\u043A\u043E \u0432\u0456\u0434\u043E\u043C\u0438\u0439 \u0442\u0430\u043A\u043E\u0436 \u0430\u043B\u0433\u043E\u0440\u0438\u0442\u043C \u0414\u0435\u0439\u043A\u0441\u0442\u0440\u0438 \u0437\u043D\u0430\u0445\u043E\u0434\u0436\u0435\u043D\u043D\u044F \u043D\u0430\u0439\u043A\u043E\u0440\u043E\u0442\u0448\u043E\u0433\u043E \u0448\u043B\u044F\u0445\u0443 \u0443 \u0433\u0440\u0430\u0444\u0456."@uk , "Edsger Wybe Dijkstra was een Nederlandse wiskundige en informaticus die veel voor de informatica heeft gedaan, met name op het gebied van gestructureerd programmeren. In 1972 werd hij onderscheiden met de Turing Award."@nl , "Edsger Wybe Dijkstra, f\u00F6dd 30 maj 1930, d\u00F6d 6 augusti 2002, var en nederl\u00E4ndsk datavetare. Dijkstra studerade teoretisk fysik vid Universitet i Leiden. Han arbetade som en forskarkompanion f\u00F6r Burroughs Corporation i det tidiga 1970-talet. Han h\u00F6ll Schlumberger Centennial-stol i datavetenskap i University of Texas i Austin, i USA. Han drog sig tillbaka 2000. Bland hans bidrag till datorvetenskapen finner man kortaste v\u00E4gen-algoritmen, \u00E4ven k\u00E4nd som Dijkstras algoritm. Han mottog Turingpriset 1972. Han fick stor betydelse f\u00F6r utvecklingen av begreppet strukturerad programmering genom sin kritiska uppsats mot anv\u00E4ndandet av GOTO-satsen, \"Go To Statement Considered Harmful\", som han skrev d\u00E5 han var professor vid Eindhovens universitet. Han \u00E4r \u00E4ven en av upphovsm\u00E4nnen till den s\u00E5 kallade bankiralgoritmen (Banker's Algorithm) som behandlar problemet att f\u00F6rdela \u00E4ndliga resurser. Han dog den 6 augusti, 2002 efter en tids kamp mot cancer."@sv , "\u827E\u5179\u683C\u00B7\u8FEA\u79D1\u65AF\u5F7B\uFF08Edsger Wybe Dijkstra\uFF0C1930\u5E745\u670811\u65E5\uFF0D2002\u5E748\u67086\u65E5\uFF09\uFF0C\u8377\u5170\u8BA1\u7B97\u673A\u79D1\u5B66\u5BB6\uFF0C\u6BD5\u4E1A\u5C31\u804C\u4E8E\u8377\u5170\u83B1\u987F\u5927\u5B66\uFF0C\u65E9\u5E74\u94BB\u7814\u7269\u7406\u53CA\u6570\u5B66\uFF0C\u800C\u540E\u8F6C\u4E3A\u8BA1\u7B97\u5B66\u3002\u66FE\u57281972\u5E74\u83B7\u5F97\u8FC7\u7D20\u6709\u8BA1\u7B97\u673A\u79D1\u5B66\u754C\u7684\u8BFA\u8D1D\u5C14\u5956\u4E4B\u79F0\u7684\u56FE\u7075\u5956\uFF0C\u4E4B\u540E\uFF0C\u4ED6\u8FD8\u83B7\u5F97\u8FC71974\u5E74AFIPS Harry Goode Memorial Award\u30011989\u5E74ACM SIGCSE\u8BA1\u7B97\u673A\u79D1\u5B66\u6559\u80B2\u6559\u5B66\u6770\u51FA\u8D21\u732E\u5956\u3001\u4EE5\u53CA2002\u5E74ACM PODC\u6700\u5177\u5F71\u54CD\u529B\u8BBA\u6587\u5956\u3002 \u66FE\u7ECF\u63D0\u51FA\u201CGOTO\u6709\u5BB3\u8BBA\u201D\u4FE1\u53F7\u91CF\u548CPV\u539F\u8BED\uFF0C\u89E3\u51B3\u4E86\u6709\u8DA3\u7684\u201C\u54F2\u5B66\u5BB6\u5C31\u9910\u95EE\u9898\u201D\u3002\u4E8E2002\u5E748\u67086\u65E5\u5728\u8377\u5170Nuenen\u81EA\u5DF1\u7684\u5BB6\u4E2D\u4E0E\u4E16\u957F\u8F9E\u3002\u7EC8\u5E7472\u5C81\u3002 \u827E\u5179\u683C·W·\u8FEA\u79D1\u65AF\u5F7B\u7684\u8D21\u732E\u5305\u62EC\uFF1A \u63D0\u51FA\u4E86\u76EE\u524D\u79BB\u6563\u6570\u5B66\u5E94\u7528\u5E7F\u6CDB\u7684\u6700\u77ED\u8DEF\u5F84\u7B97\u6CD5\uFF08Dijkstra's Shortest Path First Algorithm\uFF09 \u4E3A\u89E3\u51B3\u64CD\u4F5C\u7CFB\u7EDF\u4E2D\u8D44\u6E90\u5206\u914D\u95EE\u9898\uFF0C\u63D0\u51FA\u94F6\u884C\u5BB6\u7B97\u6CD5"@zh ; rdfs:comment "Edsger Wybe Dijkstra - holenderski naukowiec, pionier informatyki. Informatyk\u0105 zajmowa\u0142 si\u0119 g\u0142\u00F3wnie od strony teoretycznej. Zajmowa\u0142 si\u0119 r\u00F3\u017Cnymi jej aspektami, mi\u0119dzy innymi algorytmik\u0105, j\u0119zykami programowania, formaln\u0105 specyfikacj\u0105 i weryfikacj\u0105."@pl , "Edsger Wybe Dijkstra est un math\u00E9maticien et informaticien n\u00E9erlandais du XX si\u00E8cle."@fr , "Edsger Wybe Dijkstra [\u02C8\u025Bt\u02CCsx\u0259r \u02C8d\u025B\u026Ak\u02CCstra] IPA byl nizozemsk\u00FD informatik. V roce 1972 obdr\u017Eel Turingovu cenu za sv\u00E9 p\u0159\u00EDsp\u011Bvky rozvoji programovac\u00EDch jazyk\u016F."@cs , ""@zh , "Edsger Wybe Dijkstra Hollandal\u0131 matematik\u00E7i ve bilgisayarc\u0131."@tr , ""@ja , "Edsger Wybe Dijkstra was een Nederlandse wiskundige en informaticus die veel voor de informatica heeft gedaan, met name op het gebied van gestructureerd programmeren. In 1972 werd hij onderscheiden met de Turing Award."@nl , "F\u00E1jl:Edsger Wybe Dijkstra. jpg Edsger Wybe Dijkstra Edsger Wybe Dijkstra [\u02C8\u025Bt\u02CCsx\u0259r \u02C8d\u025B\u026Ak\u02CCstra] holland matematikus, informatikus."@hu , "Edsger Wybe Dijkstra, f\u00F6dd 30 maj 1930, d\u00F6d 6 augusti 2002, var en nederl\u00E4ndsk datavetare. Dijkstra studerade teoretisk fysik vid Universitet i Leiden. Han arbetade som en forskarkompanion f\u00F6r Burroughs Corporation i det tidiga 1970-talet. Han h\u00F6ll Schlumberger Centennial-stol i datavetenskap i University of Texas i Austin, i USA. Han drog sig tillbaka 2000. Bland hans bidrag till datorvetenskapen finner man kortaste v\u00E4gen-algoritmen, \u00E4ven k\u00E4nd som Dijkstras algoritm."@sv , "Edsger Wybe Dijkstra was a Dutch computer scientist. He received the 1972 Turing Award for fundamental contributions to developing programming languages, and was the Schlumberger Centennial Chair of Computer Sciences at The University of Texas at Austin from 1984 until 2000. Shortly before his death in 2002, he received the ACM PODC Influential Paper Award in distributed computing for his work in the sub-topic of self-stabilization of program computation."@en , "Edsger Wybe Dijkstra fue un cient\u00EDfico de la computaci\u00F3n de origen holand\u00E9s."@es , "\u0424\u0430\u0439\u043B:Edsger Wybe Dijkstra. jpg \u042D\u0434\u0441\u0433\u0435\u0440 \u0412\u0438\u0431\u0435 \u0414\u0435\u0439\u043A\u0441\u0442\u0440\u0430 \u042D\u0301\u0434\u0441\u0433\u0435\u0440 \u0412\u0438\u0301\u0431\u0435 \u0414\u0435\u0301\u0439\u043A\u0441\u0442\u0440\u0430\u00A0\u2014 \u0432\u044B\u0434\u0430\u044E\u0449\u0438\u0439\u0441\u044F \u043D\u0438\u0434\u0435\u0440\u043B\u0430\u043D\u0434\u0441\u043A\u0438\u0439 \u0443\u0447\u0451\u043D\u044B\u0439, \u0438\u0434\u0435\u0438 \u043A\u043E\u0442\u043E\u0440\u043E\u0433\u043E \u043E\u043A\u0430\u0437\u0430\u043B\u0438 \u043E\u0433\u0440\u043E\u043C\u043D\u043E\u0435 \u0432\u043B\u0438\u044F\u043D\u0438\u0435 \u043D\u0430 \u0440\u0430\u0437\u0432\u0438\u0442\u0438\u0435 \u043A\u043E\u043C\u043F\u044C\u044E\u0442\u0435\u0440\u043D\u043E\u0439 \u0438\u043D\u0434\u0443\u0441\u0442\u0440\u0438\u0438."@ru , "Edsger Wybe Dijkstra foi um cientista da computa\u00E7\u00E3o neerland\u00EAs conhecido por suas contribui\u00E7\u00F5es nas \u00E1reas de desenvolvimento de algoritmos e programas, de linguagens de programa\u00E7\u00E3o (pelo qual recebeu o Turing Award de 1972 por suas contribui\u00E7\u00F5es fundamentais), sistemas operacionais e processamento distribu\u00EDdo. A pron\u00FAncia aproximada em portugu\u00EAs para Edsger Dijkstra \u00E9 \u00E9tsrrar d\u00E9ikstra."@pt , "Edsger Wybe Dijkstra oli hollantilainen tietojenk\u00E4sittelyteoreetikko. Dijkstra opiskeli teoreettista fysiikkaa Leidenin yliopistolla. H\u00E4n ty\u00F6skenteli tutkijana Burroughs Corporationille 1970-luvun alussa. H\u00E4n ty\u00F6skenteli Eindhovenin yliopistolla Alankomaissa ja vuodesta 1984 University of Texas at Austinissa Yhdysvalloissa. Dijkstra j\u00E4i el\u00E4kkeelle vuoden 1999 marraskuussa. H\u00E4nen tunnetuin saavutuksensa lienee Dijkstran algoritmina tunnettu graafialgoritmi."@fi , "Edsger Wybe Dijkstra [\u02C8\u025Bt\u02CCsx\u0259r \u02C8d\u025B\u026Ak\u02CCstra] war ein niederl\u00E4ndischer Informatiker. Er war der Wegbereiter der strukturierten Programmierung."@de , "Edsger Wybe Dijkstra a fost un informatician olandez. Numele s\u0103u se pronun\u0163\u0103 aproximativ 'eds-h\u0103r 'deyk-stra. \u015Ei-a luat licen\u0163a \u00EEn fizic\u0103 teoretic\u0103 la Universitatea din Leiden. Dup\u0103 o perioad\u0103 de lucru ca cercet\u0103tor la Burroughs Corporation, a lucrat la Universitatea Tehnic\u0103 din Eindhoven \u015Fi mai apoi la Universitatea din Austin, Texas, de unde s-a retras \u00EEn 2000. Dijkstra a r\u0103mas celebru pentru algoritmul drumului minim \u00EEntr-un graf, algoritm care-i poart\u0103 numele."@ro , "Edsger Wybe Dijkstra; Fou un inform\u00E0tic holand\u00E8s . Va rebre el 1972 el Premi Turing per les contribucions fonamentals en l'\u00E0rea dels llenguatges de programaci\u00F3, i va ser el \"Schlumberger Centennial Chair of Computer Sciences\" a la Universitat de Texas a Austin des de 1984 fins la seva mort el 2002."@ca , "\u0424\u0430\u0439\u043B:Edsger Wybe Dijkstra. jpg \u0415\u0434\u0441\u0433\u0430\u0440 \u0412\u0456\u0431\u0435 \u0414\u0435\u0439\u043A\u0441\u0442\u0440\u0430 \u0415\u0301\u0434\u0441\u0433\u0435\u0440 \u0412\u0456\u0301\u0431\u0435 \u0414\u0435\u0301\u0439\u043A\u0441\u0442\u0440\u0430 \u2014 \u043D\u0456\u0434\u0435\u0440\u043B\u0430\u043D\u0434\u0441\u044C\u043A\u0438\u0439 \u043D\u0430\u0443\u043A\u043E\u0432\u0435\u0446\u044C \u0443 \u0433\u0430\u043B\u0443\u0437\u0456 \u043A\u043E\u043C\u043F'\u044E\u0442\u0435\u0440\u043D\u0438\u0445 \u043D\u0430\u0443\u043A. \u0423 1972 \u0440\u043E\u0446\u0456 \u0431\u0443\u0432 \u0432\u0456\u0434\u0437\u043D\u0430\u0447\u0435\u043D\u0438\u0439 \u043F\u0440\u0435\u043C\u0456\u0454\u044E \u0422\u044E\u0440\u0456\u043D\u0433\u0430 \u0437\u0430 \u0432\u0430\u0433\u043E\u043C\u0438\u0439 \u0432\u043D\u0435\u0441\u043E\u043A \u0443 \u0440\u043E\u0437\u0432\u0438\u0442\u043E\u043A \u043C\u043E\u0432 \u043F\u0440\u043E\u0433\u0440\u0430\u043C\u0443\u0432\u0430\u043D\u043D\u044F. \u0411\u0430\u0442\u044C\u043A\u043E \u0415\u0434\u0441\u0433\u0435\u0440\u0430 \u0414\u0435\u0439\u043A\u0441\u0442\u0440\u0438 \u0431\u0443\u0432 \u0445\u0456\u043C\u0456\u043A\u043E\u043C, \u0430 \u043C\u0430\u0442\u0438 \u2014 \u043C\u0430\u0442\u0435\u043C\u0430\u0442\u0438\u043A\u043E\u043C."@uk , "Edsger Wybe Dijkstra var en nederlandsk fysiker og informatiker. Han var med p\u00E5 \u00E5 grunnlegge informatikk som vitenskap. I 1945 begynte Edsger Dijkstra p\u00E5 Universitetet i Leiden, der han studerte teoretisk fysikk. Sommeren 1951 l\u00E6rte han seg programmering p\u00E5 et sommerkurs. Han begynte \u00E5 arbeide deltid for Det matematiske senter i Amsterdam i mars 1952, noe som gjorde ham enda mer interessert i programmering."@no , "I suoi pi\u00F9 importanti contributi all'informatica sono stati il cosiddetto algoritmo di Dijkstra e il concetto di semaforo."@it ; foaf:depiction . @prefix skos: . @prefix ns12: . skos:subject ns12:People_from_Rotterdam , ns12:Programming_language_designers , ns12:Fellows_of_the_British_Computer_Society , ns12:Fellows_of_the_Association_for_Computing_Machinery , ns12:Dutch_physicists , ns12:Software_engineering_researchers , ns12:Turing_Award_laureates , ns12:Leiden_University_alumni , ns12:Dutch_computer_scientists , ns12:Computer_pioneers , , ns12:Formal_methods_people , ns12:Software_engineers , , ns12:Eindhoven_University_of_Technology_faculty , ns12:Programming_language_researchers , ns12:Researchers_in_distributed_computing , ns12:University_of_Texas_at_Austin_faculty . @prefix ns13: . dbpprop:wikiPageUsesTemplate ns13:infobox_scientist , ns13:persondata . @prefix ns14: . dbpprop:birthDate ns14:Birth_date ; dbpprop:birthPlace dbpedia:Netherlands , dbpedia:Rotterdam . @prefix ns15: . dbpprop:deathDate ns15:death_date_and_age ; dbpprop:deathPlace dbpedia:The_Netherlands , dbpedia:Nuenen , dbpedia:Netherlands ; dbpprop:imageWidth "150px"@en ; dbpprop:field dbpedia:Computer_science ; dbpprop:workInstitutions dbpedia:University_of_Texas_at_Austin , dbpedia:National_Research_Institute_for_Mathematics_and_Computer_Science , dbpedia:Eindhoven_University_of_Technology . @prefix ns16: . dbpprop:dateOfBirth ns16:birth_date . @prefix ns17: . dbpprop:dateOfDeath ns17:death_date ; dbpprop:doctoralStudents dbpedia:David_Naumann , dbpedia:Jan_Tijmen_Udding , dbpedia:Antonetta_van_Gasteren , , dbpedia:Nico_Habermann , dbpedia:Martin_Rem , dbpedia:Cornelis_Hemerik ; dbpprop:shortDescription "Dutch mathematician"@en ; dbpprop:knownFor , , dbpedia:Structured_programming , dbpedia:THE_multiprogramming_system ; dbpprop:doctoralAdvisor dbpedia:Adriaan_van_Wijngaarden ; dbpprop:prizes dbpedia:Association_for_Computing_Machinery , dbpedia:Turing_Award ; dbpprop:hasPhotoCollection . @prefix ns18: . dbpprop:wordnet_type ns18:synset-scientist-noun-1 ; dbpprop:redirect . dbpedia:Edsger_W_Dijkstra dbpprop:redirect . dbpedia:Edsger_W_Dykstra dbpprop:redirect . dbpprop:redirect . dbpedia:Edgar_djikstra dbpprop:redirect . dbpedia:Edsgar_Dijkstra dbpprop:redirect . dbpedia:Edsger_Dijkstra dbpprop:redirect . dbpedia:Edsger_Djikstra dbpprop:redirect . dbpedia:Edsger_Wybe_Dijkstra dbpprop:redirect . dbpedia:Edsger_dijkstra dbpprop:redirect . dbpedia:Edsger_dikjstra dbpprop:redirect . dbpedia:Djikstra dbpprop:redirect . dbpedia:Edsger_Wybe_Dykstra dbpprop:redirect . dbpedia:Mr_Dicks dbpprop:redirect . dbpedia:Edgar_Dykstra dbpprop:redirect . dbpedia:Edsgar_Dykstra dbpprop:redirect . dbpedia:Edsger_Dykstra dbpprop:redirect . owl:sameAs .