Expensive Is Just a Brand Now
lcamtuf’s thing
• lcamtuf
This is an article I resisted writing for a long time.
lcamtuf’s thing
• lcamtuf
This is an article I resisted writing for a long time.
Marcus on AI
• Gary Marcus
Seven options, considered
The first time I saw Michelangelo’s David in person, I wept. Never in my life have I witnessed a more beautiful piece of content.
I wasn’t the only one who felt that way. Museum patrons all around me were looking up from their phones to admire David as well. Despite it being legacy content, David was so scrollstoppingly captivating that it generated stronger engagement than TikTok and Instagram combined, despite those platforms offering fresher, more personally relevant content.
The Old New Thing
• Raymond Chen
The easy case is easy.
The post Making an agile version of a Windows Runtime delegate in C++/WinRT, part 1 appeared first on The Old New Thing.
John D. Cook
• John
The volume of a sphere of radius r is V = 4πr³ / 3 and the surface area is A = 4πr² and so the ratio of volume to area is V / A = r / 3. Surprisingly, the same ratio holds for all regular solids if r is the radius of the largest sphere […]
The post Volume to Area ratio for Regular Solids first appeared on John D. Cook.
John D. Cook
• John
I’ve written several posts about using Claude or ChatGPT to generate Prolog or Lean code to solve a chess puzzle. I didn’t think Grok would be up to the task, though I didn’t try it. I’ve heard good things about Grok 4.5, so I gave it a shot. It did great. Here’s the problem, a […]
The post Solving a chess puzzle with Grok 4.5 first appeared on John D. Cook.
matklad
• Alex Kladov
Uplifting a lobsters comment for easier reference.
Sinds 2024 run ik OpenTK, met als doel zo goed mogelijk te laten zien wat er in de Tweede Kamer allemaal gebeurt. En, om daar ook nuttige email-notificaties over te versturen.
OpenTK is begonnen omdat ik (vanuit de Internetwereld) ineens geconfronteerd werd met een wet die over DNS (mijn hobby) ging en over een paar dagen in stemming zou komen. Dat was heel erg schrikken en ik dacht, dat kan ons nooit meer gebeuren.
Terence Eden’s Blog
• @edent
In the last year, I've been through over a dozen cities and used public transport in all of them. It is wild just how confusing and complex buying a ticket can be. While some cities obviously take a user-centred approach to ticketing, others appear to take a Kafkaesque delight in a bureaucratic maze of zones, apps, and intricate restrictions. One of the seminal texts in computer systems design…
The Silicon Underground
• Dave Farquhar
On November 4th, 1997, MCI and Worldcom merged in a deal worth $37 billion. This was an attempt by two large telecommunications companies to to combine and rival AT&T, but instead it turned into one of the biggest scandals and
The post The MCI Worldcom merger, bankruptcy, and scandal appeared first on The Silicon Underground.
We have been having extensive discussions around open source strategy. We will discuss it more at our next board meeting, but one thing we’d like to do soon is to create a language model with the approximate capability of GPT-3 that can run locally on consumer hardware and release that. We’d like to do it soon, before Stability or someone else does. In general, we think this helps discourage others from releasing similarly-powerful models, and makes it harder for new efforts to get funded.
— Sam Altman, Email to OpenAI's board, October 1, 2022 - exposed in Musk v. Altman (2026)
Tags: ai-ethics, sam-altman, generative-ai, openai, ai, llms
John D. Cook
• John
Suppose you want to search for a list of words. If you’re using grep, you can add the -f flag provide a file of regular expressions, and you can add the -F to tell it that the regular expressions are in fact just words. I did something like this a couple days ago when searching […]
The post Fitting a regular expression to a list of words first appeared on John D. Cook.
John D. Cook
• John
Squares, high and low Let p be an odd prime number. Then half the numbers from 1 through p − 1 are squares and half are not. That is, for half of numbers 1 ≤ k < p, the equation x² = k mod p has a solution. The traditional name for these numbers is […]
The post Sum of low squares first appeared on John D. Cook.