#dijkstra โ Public Fediverse posts
Live and recent posts from across the Fediverse tagged #dijkstra, aggregated by home.social.
-
๐ฉ๐ผ๐ฒ๐๐ฏ๐ฎ๐น๐๐๐ฒ๐ฟ ๐๐ถ๐ท๐ธ๐๐๐ฟ๐ฎ ๐๐ฒ๐ฟ๐ฟ๐๐ถ๐น๐ ๐ฉ๐ณ๐ ๐ช๐ผ๐น๐ณ๐๐ฏ๐๐ฟ๐ด ๐๐ผ๐ผ๐ฟ ๐ง๐ผ๐๐๐ฒ๐ป๐ต๐ฎ๐บ
Oranje-international Caitlin Dijkstra maakt na haar transfervrije vertrek bij VfL Wolfsburg de overstap naar Tottenham Hotspur. Bij de nummer 5 van afgelopen seizoen in Engeland heeft de 27-jarige verdedigster een contract getekend voor "de lange termijn".
-
๐ฉ๐ผ๐ฒ๐๐ฏ๐ฎ๐น๐๐๐ฒ๐ฟ ๐๐ถ๐ท๐ธ๐๐๐ฟ๐ฎ ๐๐ฒ๐ฟ๐ฟ๐๐ถ๐น๐ ๐ฉ๐ณ๐ ๐ช๐ผ๐น๐ณ๐๐ฏ๐๐ฟ๐ด ๐๐ผ๐ผ๐ฟ ๐ง๐ผ๐๐๐ฒ๐ป๐ต๐ฎ๐บ
Oranje-international Caitlin Dijkstra maakt na haar transfervrije vertrek bij VfL Wolfsburg de overstap naar Tottenham Hotspur. Bij de nummer 5 van afgelopen seizoen in Engeland heeft de 27-jarige verdedigster een contract getekend voor "de lange termijn".
-
๐ฉ๐ผ๐ฒ๐๐ฏ๐ฎ๐น๐๐๐ฒ๐ฟ ๐๐ถ๐ท๐ธ๐๐๐ฟ๐ฎ ๐๐ฒ๐ฟ๐ฟ๐๐ถ๐น๐ ๐ฉ๐ณ๐ ๐ช๐ผ๐น๐ณ๐๐ฏ๐๐ฟ๐ด ๐๐ผ๐ผ๐ฟ ๐ง๐ผ๐๐๐ฒ๐ป๐ต๐ฎ๐บ
Oranje-international Caitlin Dijkstra maakt na haar transfervrije vertrek bij VfL Wolfsburg de overstap naar Tottenham Hotspur. Bij de nummer 5 van afgelopen seizoen in Engeland heeft de 27-jarige verdedigster een contract getekend voor "de lange termijn".
-
๐ฉ๐ผ๐ฒ๐๐ฏ๐ฎ๐น๐๐๐ฒ๐ฟ ๐๐ถ๐ท๐ธ๐๐๐ฟ๐ฎ ๐๐ฒ๐ฟ๐ฟ๐๐ถ๐น๐ ๐ฉ๐ณ๐ ๐ช๐ผ๐น๐ณ๐๐ฏ๐๐ฟ๐ด ๐๐ผ๐ผ๐ฟ ๐ง๐ผ๐๐๐ฒ๐ป๐ต๐ฎ๐บ
Oranje-international Caitlin Dijkstra maakt na haar transfervrije vertrek bij VfL Wolfsburg de overstap naar Tottenham Hotspur. Bij de nummer 5 van afgelopen seizoen in Engeland heeft de 27-jarige verdedigster een contract getekend voor "de lange termijn".
-
๐ฉ๐ผ๐ฒ๐๐ฏ๐ฎ๐น๐๐๐ฒ๐ฟ ๐๐ถ๐ท๐ธ๐๐๐ฟ๐ฎ ๐๐ฒ๐ฟ๐ฟ๐๐ถ๐น๐ ๐ฉ๐ณ๐ ๐ช๐ผ๐น๐ณ๐๐ฏ๐๐ฟ๐ด ๐๐ผ๐ผ๐ฟ ๐ง๐ผ๐๐๐ฒ๐ป๐ต๐ฎ๐บ
Oranje-international Caitlin Dijkstra maakt na haar transfervrije vertrek bij VfL Wolfsburg de overstap naar Tottenham Hotspur. Bij de nummer 5 van afgelopen seizoen in Engeland heeft de 27-jarige verdedigster een contract getekend voor "de lange termijn".
-
@davidgerard When one blindly trusts purely #GenAI built software beyond throwaway prototypes, one is basically both being very stupid, and throwing money at stupidity. It wasn't just #Dijkstra in 1975 at #ACM warning of the "complexity generators"; the #CHILI effort predates the trend also. https://chili.cs.illinois.edu/ And the #SOUP definition, Software of Unknown Provenance: https://en.wikipedia.org/wiki/Software_of_unknown_pedigree I prefer the #IEC62304 (medical products) wording. #LLms #agentic #ai @wdtz
-
@davidgerard When one blindly trusts purely #GenAI built software beyond throwaway prototypes, one is basically both being very stupid, and throwing money at stupidity. It wasn't just #Dijkstra in 1975 at #ACM warning of the "complexity generators"; the #CHILI effort predates the trend also. https://chili.cs.illinois.edu/ And the #SOUP definition, Software of Unknown Provenance: https://en.wikipedia.org/wiki/Software_of_unknown_pedigree I prefer the #IEC62304 (medical products) wording. #LLms #agentic #ai @wdtz
-
@davidgerard When one blindly trusts purely #GenAI built software beyond throwaway prototypes, one is basically both being very stupid, and throwing money at stupidity. It wasn't just #Dijkstra in 1975 at #ACM warning of the "complexity generators"; the #CHILI effort predates the trend also. https://chili.cs.illinois.edu/ And the #SOUP definition, Software of Unknown Provenance: https://en.wikipedia.org/wiki/Software_of_unknown_pedigree I prefer the #IEC62304 (medical products) wording. #LLms #agentic #ai @wdtz
-
@davidgerard When one blindly trusts purely #GenAI built software beyond throwaway prototypes, one is basically both being very stupid, and throwing money at stupidity. It wasn't just #Dijkstra in 1975 at #ACM warning of the "complexity generators"; the #CHILI effort predates the trend also. https://chili.cs.illinois.edu/ And the #SOUP definition, Software of Unknown Provenance: https://en.wikipedia.org/wiki/Software_of_unknown_pedigree I prefer the #IEC62304 (medical products) wording. #LLms #agentic #ai @wdtz
-
@davidgerard When one blindly trusts purely #GenAI built software beyond throwaway prototypes, one is basically both being very stupid, and throwing money at stupidity. It wasn't just #Dijkstra in 1975 at #ACM warning of the "complexity generators"; the #CHILI effort predates the trend also. https://chili.cs.illinois.edu/ And the #SOUP definition, Software of Unknown Provenance: https://en.wikipedia.org/wiki/Software_of_unknown_pedigree I prefer the #IEC62304 (medical products) wording. #LLms #agentic #ai @wdtz
-
@jik In 1975, Prof. #Dijkstra warned of #complexitygenerators ; Also, the inventor of the #UDP User Datagram Protocol, David P. Reed, appears to share your opinion.
Source: Public discussion with him yesterday, on the somewhat socially corrupted professional networking site we all know and loathe. https://www.cs.utexas.edu/~EWD/transcriptions/EWD04xx/EWD480.html @wdtz -
@jik In 1975, Prof. #Dijkstra warned of #complexitygenerators ; Also, the inventor of the #UDP User Datagram Protocol, David P. Reed, appears to share your opinion.
Source: Public discussion with him yesterday, on the somewhat socially corrupted professional networking site we all know and loathe. https://www.cs.utexas.edu/~EWD/transcriptions/EWD04xx/EWD480.html @wdtz -
@jik In 1975, Prof. #Dijkstra warned of #complexitygenerators ; Also, the inventor of the #UDP User Datagram Protocol, David P. Reed, appears to share your opinion.
Source: Public discussion with him yesterday, on the somewhat socially corrupted professional networking site we all know and loathe. https://www.cs.utexas.edu/~EWD/transcriptions/EWD04xx/EWD480.html @wdtz -
@jik In 1975, Prof. #Dijkstra warned of #complexitygenerators ; Also, the inventor of the #UDP User Datagram Protocol, David P. Reed, appears to share your opinion.
Source: Public discussion with him yesterday, on the somewhat socially corrupted professional networking site we all know and loathe. https://www.cs.utexas.edu/~EWD/transcriptions/EWD04xx/EWD480.html @wdtz -
@jik In 1975, Prof. #Dijkstra warned of #complexitygenerators ; Also, the inventor of the #UDP User Datagram Protocol, David P. Reed, appears to share your opinion.
Source: Public discussion with him yesterday, on the somewhat socially corrupted professional networking site we all know and loathe. https://www.cs.utexas.edu/~EWD/transcriptions/EWD04xx/EWD480.html @wdtz -
The art of #oneliner #programming - viewed from two very different perspectives: Edsger #Dijkstra and Donald #Knuth:
-
The art of #oneliner #programming - viewed from two very different perspectives: Edsger #Dijkstra and Donald #Knuth:
-
The art of #oneliner #programming - viewed from two very different perspectives: Edsger #Dijkstra and Donald #Knuth:
-
The art of #oneliner #programming - viewed from two very different perspectives: Edsger #Dijkstra and Donald #Knuth:
-
Jak pokonaฤ krรณla po 66 latach? Matematyczny przewrรณt w teorii najkrรณtszej ลcieลผki
Za kaลผdym razem, gdy uruchamiasz Google Maps, by znaleลบฤ trasฤ do nowej kawiarni, Twรณj telefon wykonuje matematyczny taniec, ktรณrego kroki opracowano w 1959 roku.
Przez ponad szeลฤ dekad algorytm Dijkstry byล niekwestionowanym wลadcฤ drรณg, ลwiatลowodรณw i rezerwacji lotniczych. Aลผ do teraz, kiedy grupa naukowcรณw z Chin udowodniลa, ลผe przez wiele lat wszyscy zadawaliลmy zลe pytanie.
Certyfikat nietykalnoลci
Algorytm Dijkstry to fundament informatyki. Jest tak dobry, ลผe jeszcze w 2024 roku Robert Tarjan (legenda teorii grafรณw, laureat Nagrody Turinga w 1986 roku) wraz ze wspรณลpracownikami zdobyล prestiลผowฤ nagrodฤ na konferencji FOCS za udowodnienie, ลผe Dijkstra jest optymalny. Oznaczaลo to, ลผe matematycznie nie da siฤ znaleลบฤ najkrรณtszej ลcieลผki szybciej. Wydawaลo siฤ, ลผe temat jest zamkniฤty.
Jednak zaledwie osiem miesiฤcy pรณลบniej zespรณล z Uniwersytetu Tsinghua pod kierownictwem Rana Duana opublikowaล artykuล, ktรณry zburzyล ten mur. To praca z 2025 roku, ale uznaliลmy, ลผe temat ciekawy, w sam raz na weekend.
Puลapka definicji: co wลaลciwie liczymy?
Jak to moลผliwe, ลผe ktoล pobiล algorytm uznany za โnajlepszy z moลผliwychโ? Okazaลo siฤ, ลผe Tarjan i caลa reszta ลwiata wpadli w puลapkฤ definicji.
Dowรณd na optymalnoลฤ Dijkstry zakลadaล, ลผe algorytm musi nie tylko podaฤ odlegลoลฤ, ale teลผ wyprowadziฤ wszystkie punkty na trasie posortowane wedลug dystansu. Grupa z Tsinghua zauwaลผyลa coล, co w akademickich kuluarach przyjmowano juลผ od 1984 roku: znalezienie najkrรณtszej ลcieลผki wcale nie wymaga sortowania wszystkiego po drodze. Problem brzmi โznajdลบ odlegลoลฤโ, a nie โposortuj miastoโ.
Nowa granica prฤdkoลci
Chiลski zespรณล poลฤ czyล stare metody (algorytm Bellmana-Forda) z nowatorskim trikiem โrekurencyjnego czฤลciowego porzฤ dkowaniaโ. Zamiast sprawdzaฤ kaลผdฤ uliczkฤ po kolei, zaczฤli grupowaฤ wฤzลy i badaฤ tylko ich โreprezentantรณwโ. Wynik to nowa zลoลผonoลฤ obliczeniowa. To pierwszy taki wyลom w โsuficieโ wydajnoลci wyznaczania trasy od dekad.
Warto jednak postawiฤ tu waลผnฤ gwiazdkฤ: to odkrycie to przede wszystkim trzฤsienie ziemi w teorii algorytmรณw. W ลwiecie rzeczywistym โ tym, w ktรณrym dziaลajฤ serwery Google czy systemy routingowe (bo nie tylko o nawigacjฤ tu chodzi, takลผe wyznaczanie tras pakietรณw danych i wiele wiฤcej) โ od dawna rzadko uลผywa siฤ โczystegoโ Dijkstry. Inลผynierowie stosujฤ tam heurystyki (jak A*; jeden z najpopularniejszych algorytmรณw heurystycznych wyszukiwania ลcieลผki w grafie, stosowany powszechnie w nawigacji GPS, ale teลผ np. w sztucznej inteligencji w grach wideo), hierarchie grafรณw i zaawansowany precomputing, ktรณre w praktycznych zastosowaniach i tak wykraczajฤ poza ramy tego odkrycia. Chiลski zespรณล udowodniล jednak coล waลผniejszego: matematyczny mur, ktรณry uwaลผaliลmy za nieprzekraczalny, wลaลnie runฤ ล.
Lekcja dla nas wszystkich
Ta historia to coล wiฤcej niลผ ciekawostka dla programistรณw. To mocna lekcja o tym, jak ramy, w ktรณrych osadzamy problem, stajฤ siฤ naszymi ograniczeniami. Dijkstra byล najlepszy w rozwiฤ zywaniu zadania โnajkrรณtsza ลcieลผka z posortowanym wynikiemโ. ลwiat potrzebowaล po prostu โnajkrรณtszej ลcieลผkiโ.
Traktowaliลmy te dwa problemy jako jednoลฤ przez dekady tylko dlatego, ลผe nikt nie zapytaล: โczy to sortowanie jest nam w ogรณle potrzebne?โ. Najbardziej ugruntowany algorytm ลwiata zostaล pokonany nie przez potฤลผniejszy procesor, ale przez kogoล, kto zakwestionowaล samฤ definicjฤ limitu.
#algorytmy #Dijkstra #googleMaps #iMagazineTech #informatyka #Nauka #nawigacja #teoriaGrafรณw #TsinghuaUniversityNajwiฤksza mapa Wszechลwiata gotowa. Wลaลnie zaczyna siฤ trzฤsienie ziemi w ลwiecie fizyki
-
Oh, gasp! Yet another fawning #tribute to #Dijkstra, this time for his whimsical musings on the enigma that is #APL. โ๏ธ๐ Because nothing screams cutting-edge computer science like an old letter from 1982 unearthed with the help of an entire committee. ๐คฆโโ๏ธ๐
https://www.jsoftware.com/papers/Dijkstra_Letter.htm #ComputerScience #Nostalgia #1982Letter #HackerNews #ngated -
Oh, gasp! Yet another fawning #tribute to #Dijkstra, this time for his whimsical musings on the enigma that is #APL. โ๏ธ๐ Because nothing screams cutting-edge computer science like an old letter from 1982 unearthed with the help of an entire committee. ๐คฆโโ๏ธ๐
https://www.jsoftware.com/papers/Dijkstra_Letter.htm #ComputerScience #Nostalgia #1982Letter #HackerNews #ngated -
Oh, gasp! Yet another fawning #tribute to #Dijkstra, this time for his whimsical musings on the enigma that is #APL. โ๏ธ๐ Because nothing screams cutting-edge computer science like an old letter from 1982 unearthed with the help of an entire committee. ๐คฆโโ๏ธ๐
https://www.jsoftware.com/papers/Dijkstra_Letter.htm #ComputerScience #Nostalgia #1982Letter #HackerNews #ngated -
Oh, gasp! Yet another fawning #tribute to #Dijkstra, this time for his whimsical musings on the enigma that is #APL. โ๏ธ๐ Because nothing screams cutting-edge computer science like an old letter from 1982 unearthed with the help of an entire committee. ๐คฆโโ๏ธ๐
https://www.jsoftware.com/papers/Dijkstra_Letter.htm #ComputerScience #Nostalgia #1982Letter #HackerNews #ngated -
Oh, gasp! Yet another fawning #tribute to #Dijkstra, this time for his whimsical musings on the enigma that is #APL. โ๏ธ๐ Because nothing screams cutting-edge computer science like an old letter from 1982 unearthed with the help of an entire committee. ๐คฆโโ๏ธ๐
https://www.jsoftware.com/papers/Dijkstra_Letter.htm #ComputerScience #Nostalgia #1982Letter #HackerNews #ngated -
I have learnt about Dijkstra using Leonardo numbers (basically like Fibonacci, but his first name was Leonardo) to virtually treat indexed array as binary tree in 1981... and my head kinda exploded:
So you can have binary tree without pointers and all this stuff! Just by knowing how far ahead you need to look into array.
-
New #blog post: Monocultures Considered Harmful or: Why Linux Nerds Should Give BSD and Other "Weird" OSes a Try
545 words
cc: my wonderful #chorus: @joel @dm @sotolf @thedoctor @pixx @orbitalmartian @adamsdesk @krafter @roguefoam @clayton @giantspacesquid @Twizzay @stfn @ay
(I will happily add/remove you from the chorus upon request! :)
#rlDaneWriting #blost #Linux #BSD #RunBSD #FreeBSD #OpenBSD #EdsgerDijkstra #Dijkstra #monoculture #monocultures #ConsideredHarmful
-
New #blog post: Monocultures Considered Harmful or: Why Linux Nerds Should Give BSD and Other "Weird" OSes a Try
545 words
cc: my wonderful #chorus: @joel @dm @sotolf @thedoctor @pixx @orbitalmartian @adamsdesk @krafter @roguefoam @clayton @giantspacesquid @Twizzay @stfn @ay
(I will happily add/remove you from the chorus upon request! :)
#rlDaneWriting #blost #Linux #BSD #RunBSD #FreeBSD #OpenBSD #EdsgerDijkstra #Dijkstra #monoculture #monocultures #ConsideredHarmful
-
New #blog post: Monocultures Considered Harmful or: Why Linux Nerds Should Give BSD and Other "Weird" OSes a Try
545 words
cc: my wonderful #chorus: @joel @dm @sotolf @thedoctor @pixx @orbitalmartian @adamsdesk @krafter @roguefoam @clayton @giantspacesquid @Twizzay @stfn @ay
(I will happily add/remove you from the chorus upon request! :)
#rlDaneWriting #blost #Linux #BSD #RunBSD #FreeBSD #OpenBSD #EdsgerDijkstra #Dijkstra #monoculture #monocultures #ConsideredHarmful
-
New #blog post: Monocultures Considered Harmful or: Why Linux Nerds Should Give BSD and Other "Weird" OSes a Try
545 words
cc: my wonderful #chorus: @joel @dm @sotolf @thedoctor @pixx @orbitalmartian @adamsdesk @krafter @roguefoam @clayton @giantspacesquid @Twizzay @stfn @ay
(I will happily add/remove you from the chorus upon request! :)
#rlDaneWriting #blost #Linux #BSD #RunBSD #FreeBSD #OpenBSD #EdsgerDijkstra #Dijkstra #monoculture #monocultures #ConsideredHarmful
-
New #blog post: Monocultures Considered Harmful or: Why Linux Nerds Should Give BSD and Other "Weird" OSes a Try
545 words
cc: my wonderful #chorus: @joel @dm @sotolf @thedoctor @pixx @orbitalmartian @adamsdesk @krafter @roguefoam @clayton @giantspacesquid @Twizzay @stfn @ay
(I will happily add/remove you from the chorus upon request! :)
#rlDaneWriting #blost #Linux #BSD #RunBSD #FreeBSD #OpenBSD #EdsgerDijkstra #Dijkstra #monoculture #monocultures #ConsideredHarmful
-
@AlSweigart ...or, when we talk about Dijkstra's algorithm, why not make it O(m log^(2/3) n)!? ๐
Breaking the Sorting Barrier for Directed Single-Source Shortest Paths:
https://arxiv.org/abs/2504.17033
To achieve this, the researchers _combine_ Dijkstraโs algorithm with Bellman-Ford algorithm - incredible stuff! ๐ค
-
@AlSweigart ...or, when we talk about Dijkstra's algorithm, why not make it O(m log^(2/3) n)!? ๐
Breaking the Sorting Barrier for Directed Single-Source Shortest Paths:
https://arxiv.org/abs/2504.17033
To achieve this, the researchers _combine_ Dijkstraโs algorithm with Bellman-Ford algorithm - incredible stuff! ๐ค
-
@AlSweigart ...or, when we talk about Dijkstra's algorithm, why not make it O(m log^(2/3) n)!? ๐
Breaking the Sorting Barrier for Directed Single-Source Shortest Paths:
https://arxiv.org/abs/2504.17033
To achieve this, the researchers _combine_ Dijkstraโs algorithm with Bellman-Ford algorithm - incredible stuff! ๐ค
-
@AlSweigart ...or, when we talk about Dijkstra's algorithm, why not make it O(m log^(2/3) n)!? ๐
Breaking the Sorting Barrier for Directed Single-Source Shortest Paths:
https://arxiv.org/abs/2504.17033
To achieve this, the researchers _combine_ Dijkstraโs algorithm with Bellman-Ford algorithm - incredible stuff! ๐ค
-
@AlSweigart ...or, when we talk about Dijkstra's algorithm, why not make it O(m log^(2/3) n)!? ๐
Breaking the Sorting Barrier for Directed Single-Source Shortest Paths:
https://arxiv.org/abs/2504.17033
To achieve this, the researchers _combine_ Dijkstraโs algorithm with Bellman-Ford algorithm - incredible stuff! ๐ค
-
๐ก #Programming is first and foremost about thinking, reflecting and designing solutions, not just typing random code.
Behind every line there is an idea, a mental architecture that transforms complex problems into clear steps.
๐ฃ๏ธ As Edsger #Dijkstra says, "Programming is the art of organising and selecting thoughts, not keys."
Without a clear mind, code remains just empty sequences.
-
๐ดโจ Behold, the sacred tomb of Dijkstraโs #manuscripts, where mortals may dare to glimpse the unspeakable #wisdom of computingโs messiah! ๐๏ธ๐ Navigate the labyrinth of numerically-coded relics, because who needs intuitive organization when you can just guess which century-old gem might hold the secret to your next #debugging nightmare? ๐ค๐ข
https://www.cs.utexas.edu/~EWD/ #Dijkstra #Computing #History #HackerNews #ngated -
A new way to find the best routes - faster, smarter, elegant. It reminds me that simplicity often hides deep beauty in mathematics. #ShortestPaths #Dijkstra #Algorithms #Math #Innovation #ComputerScience
A New Algorithm Makes It Faste... -
An ingenious new route to shortest path solutions.
https://www.wired.com/story/new-method-is-the-fastest-way-to-find-the-best-routes/
-
#Dijkstra already said it: *"As a result of the educational trend away from intellectual discipline, the last decades have shown in the Western world a sharp decline of people's mastery of their own language"* https://www-cs-utexas-edu.translate.goog/~EWD/transcriptions/EWD06xx/EWD667.html?_x_tr_sl=auto&_x_tr_tl=es&_x_tr_hl=en&_x_tr_pto=wapp
-
On the foolishness of "natural programming languages."
https://www.cs.utexas.edu/~EWD/transcriptions/EWD06xx/EWD667.html
-
-
Chinaโs Tsinghua University helps to break 40-year-old maths cap on computer speed
Chinesโฆ
#NewsBeep #News #Computing #ACMSymposiumonTheoryofComputing(STOC) #arXiv #Bellman-Ford #BestPaperAward #CA #Canada #Chinesescientists #chipdesign #Dijkstra'salgorithm #dronenavigation #DuanRan #InstituteforInterdisciplinaryInformationSciences(IIIS) #MaoXiao #Prague #PrincetonUniversity #quantamagazine #RobertTarjan #StanfordUniversity #Technology #TsinghuaUniversity
https://www.newsbeep.com/ca/73985/ -
Chinaโs Tsinghua University helps to break 40-year-old maths cap on computer speed
#NewsBeep #News #Computing #ACMSymposiumonTheoryofComputing(STOC) #arXiv #Bellman-Ford #BestPaperAward #chinesescientists #chipdesign #Dijkstra'salgorithm #dronenavigation #DuanRan #InstituteforInterdisciplinaryInformationSciences(IIIS) #MaoXiao #Prague #PrincetonUniversity #quantamagazine #RobertTarjan #StanfordUniversity #Technology #TsinghuaUniversity #UK #UnitedKingdom
https://www.newsbeep.com/uk/70971/ -
New Method Is the Fastest Way To Find the Best Routes - Slashdot
Well, **that's a new worthy of attention**, an algorithm beating #Dijkstra
-
On the foolishness of "natural language programming"
prof.dr.Edsger W.Dijkstra
https://www.cs.utexas.edu/~EWD/transcriptions/EWD06xx/EWD667.html