bmc7505

15 ms·

121.
Programming in the Age of Intelligent Machines(breandan.net)
2 points by bmc7505 4y ago|0 comments
122.
by bmc7505 4y ago
“The Sapir–Whorf hypothesis has been thoroughly debunked by fact-checkers at the Ministry of Truth and determined to be fake news.” Well, how reassuring!
123.
by bmc7505 4y ago
"Don't you see that the whole aim of Newspeak is to narrow the range of thought? In the end we shall make thought-crime literally impossible, because there will be no words in which to express it." —George Orwell, 19
124.
by bmc7505 4y ago
There is an interesting algorithm for sorting that is highly amenable to parallelization and which I thought this article was going to be about: https://en.wikipedia.org/wiki/Sorting_network
125.
by bmc7505 4y ago
Well said. You think clearly. Who are you?
126.
by bmc7505 4y ago
There is a statue commemorating the fallen soldiers of the Boer War in Auckland: https://goo.gl/maps/Wh8BfAnFFVU7ZbQFA
127.
by bmc7505 4y ago
SPLASH had another keynote on pattern languages this year. The analogy from architecture to programming languages seemed strained at best - the speaker spent most of the talk on social programming, i.e., programming humans how to act in cer
128.
by bmc7505 4y ago
I stayed at the Radisson in 2019 for ICFP and was astounded at the poor quality of the building, which was undergoing renovations at the time. I distinctly remember noticing visible corrosion around the foundation of the tank structure.
129.
by bmc7505 4y ago
As a frequent Amtrak passenger, I can attest to the unpunctuality of the Union Pacific and other freight operators. On several occasions we have been delayed by a passing freight train that was an hour or more behind schedule, causing us to
130.
by bmc7505 4y ago
I had always heard this saying as an undergrad in CS but never understood why names were supposed to be a hard problem until reading about modal logic about a decade later. https://en.wikipedia.org/wiki/Naming_and_Neces
131.
by bmc7505 4y ago
Also: https://www.thestrangeloop.com/
132.
One Venue, Two Conferences: Separation of Chinese and American Citation Networks(arxiv.org)
1 points by bmc7505 4y ago|0 comments
133.
by bmc7505 4y ago
Related: https://news.ycombinator.com/item?id=33585154
134.
by bmc7505 4y ago
https://typst.app/
135.
by bmc7505 4y ago
https://news.ycombinator.com/item?id=23459978
136.
by bmc7505 4y ago
Related: https://news.ycombinator.com/item?id=32780397
137.
by bmc7505 4y ago
Uncanny.
138.
It's here: the all-new Descript, backed by OpenAI Startup Fund(descript.com)
1 points by bmc7505 4y ago|1 comments
139.
by bmc7505 4y ago
Interesting bit of trivia, Prof. Ratzer, the author of this piece, was the first graduate student in computing at McGill University [1] and one of the founding members of the School of Computer Science [2], which just recently celebrated it
140.
by bmc7505 4y ago
The way I read this is that computers are a bit like telescopes, in that they allow us to appreciate the structure of the [logical] universe. These instruments sharpen our limited powers of observation, allowing us to see farther or more cl
141.
by bmc7505 4y ago
“Computer Science is no more about computers than astronomy is about telescopes.” — E. W. Dijkstra
142.
by bmc7505 4y ago
In theory, yes, but in practice proof assistants are only just starting to become practically useful for research-level mathematics. Validation/verification would likely require an enormous amount of proof engineering to build up the t
143.
by bmc7505 4y ago
During a recent programming adventure, I discovered that finite elementary cellular automata with periodic boundary conditions can be simulated using matrix-vector multiplication with a circulant matrix and a strange kind of algebra, which
144.
Discrete mean estimates and the Landau-Siegel zero(arxiv.org)
3 points by bmc7505 4y ago|0 comments
145.
by bmc7505 4y ago
https://arxiv.org/abs/2203.08069
146.
by bmc7505 4y ago
> Well, your own link proves it, doesn't it? That code simulates a bounded cellular automaton, which effectively reduces to a regular language, but that's about as far as I've been able to get. If it's possi
147.
by bmc7505 4y ago
> One person noodling around for a few weeks Well, I've been trying for about three years, but to be fair I'm a pretty slow programmer so you may have better luck. > a language being too obscure to have seen much
148.
by bmc7505 4y ago
Try it! I certainly have. You may find encoding a typelevel TM or λ-calculus more difficult than it appears... > link's example for C# would translate directly into Kotlin T() is not possible for a generic T in Kotlin.
149.
by bmc7505 4y ago
> "most of the time" being 60% I would expect this number to get closer to 99% with LLM-based AI code completion tools, so the gap between dynamically-typed languages and "good enough" languages that claim to
150.
by bmc7505 4y ago
> Have you ever used VS/Resharper/Rider with C#? Yes, and to be clear I have never encountered these issues on practical problems. I am also not claiming Kotlin has or lacks these properties, just pointing out the fac

More ›