LotusNotes

Time, Space, and Life As We Know It

What is f(x) ≤ g(x) + O(1)? Inequalities With Asymptotics

Recently I came across asympotic inequalities of the form $f(x) \le g(x) + O(1)$ in Li and Vitanyi’s An Introduction to Kolmogorov Complexity and Its Applications, where this notion is used to discuss bounds on the complexity of strings. In this post I give a brief definition of what this notation means and how it relates to standard asymptotic notation. Particulary, I’m only going to talk about the case of $O(1)$, but the same ideas can be extended to $O(h(x))$ for any function $h(x)$.

OpenBSD

the main OpenBSD page

Unpacking Cloudflare Workers CPU Performance Benchmarks

Cloudflare investigated CPU performance benchmark results for Workers, uncovering and fixing issues in infrastructure, V8 garbage collection, and OpenNext optimizations. These improvements have made Cloudflare Workers faster for all customers.

The Death Of Industrial Design And The Era Of Dull Electronics

It’s often said that what’s inside matters more than one’s looks, but it’s hard to argue that a product’s looks and its physical user experience are what makes it inst…

We Rarely Lose Technology

There are few forgotten inventions, and none that we might truly care about 🍈