jnpnalways fun reading Alan Kay stories about the past
Giacomo Tesio@[email protected]
It's so funny, if you think about it.
After all, #Dijkstra wrote
The use of COBOL cripples the mind; its teaching should, therefore, be regarded as a criminal offence.
So it's basically a race:
#LLM #vibecoding #COBOL #AIbubble
It's so funny, if you think about it.
After all, #Dijkstra wrote
The use of COBOL cripples the mind; its teaching should, therefore, be regarded as a criminal offence.
So it's basically a race:
- COBOL to cripple the LLMs
- LLMs to cripple the global finance
#LLM #vibecoding #COBOL #AIbubble
@[email protected]
It's so funny, if you think about it.
After all, #Dijkstra wrote
The use of COBOL cripples the mind; its teaching should, therefore, be regarded as a criminal offence.
So it's basically a race between
It's so funny, if you think about it.
After all, #Dijkstra wrote
The use of COBOL cripples the mind; its teaching should, therefore, be regarded as a criminal offence.
So it's basically a race between
- COBOL to cripple the LLM
- LLM to cripple the global finance
magicmarcyIn der Softwareentwicklung begegnet dir irgendwann die Idee der Trennung von Verantwortlichkeiten - Separation of Concerns (SoC). Dieser Grundsatz stammt aus der Softwaretechnik und beschreibt das Aufteilen komplexer Systeme in kleinere Abschnitte, die jeweils nur einen bestimmten Aspekt behandeln.
https://magicmarcy.de/wie-separation-of-concerns-dir-das-leben-erleichtert
#Separation #Concerns #Aspekte #Grenzen #Struktur #Verantwortlichkeiten #Dijkstra #Programming
Modular entwickeln: Wie Separation of Concerns (SoC) dir das Leben erleichtert | magicmarcy.de
In der Softwareentwicklung begegnet dir irgendwann die Idee der Trennung von Verantwortlichkeiten – Separation of Concerns (SoC). Dieser Grundsatz stammt aus der Softwaretechnik und beschreibt das Aufteilen komplexer Systeme in kleinere Abschnitte, die jeweils nur einen bestimmten Aspekt behandeln. Der niederländische Informatiker Edsger W. Dijkstra prägte den Begriff 1974 und erklärte, dass wir Aspekte getrennt untersuchen sollten, damit wir uns jeweils auf eine Sache konzentrieren können. SoC bedeutet also nicht, alles zu isolieren, sondern klare Grenzen zu ziehen, damit du Effizienz, Korrektheit und Verständlichkeit separat betrachten kannst.
Chao-c'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.
शून्यताEdsger #Dijkstra, a classic software engineer who visited the U.S.S.R in the late 1970s, said in a public speech defivered in the Grand Hall of the Academy of Sciences in Leningrad that he regarded the fact that the U.S.S.R. produced #IBM computers as the biggest U.S. victory in the #ColdWar. (i a) #Byte #ByteMagazine #Anno1991
R.L. Dane 
🍵 
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
Jan 
@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! 🤓
Breaking the Sorting Barrier for Directed Single-Source Shortest Paths
We give a deterministic $O(m\log^{2/3}n)$-time algorithm for single-source shortest paths (SSSP) on directed graphs with real non-negative edge weights in the comparison-addition model. This is the first result to break the $O(m+n\log n)$ time bound of Dijkstra's algorithm on sparse graphs, showing that Dijkstra's algorithm is not optimal for SSSP.
Hacker News
brozu ▪️💡 #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.