Viewing profile — tel
tel
HN member- Joined
- Thu, Aug 16, 2007, 4:25 AM UTC
- HN karma
- 11,021
- Public activity
- 4,045 items
- HN profile
- View on Hacker News ↗
About tel
[ my public key: https://keybase.io/tel; my proof: https://keybase.io/tel/sigs/hy256UGUMMtc9NhfOsck4vuCiby6UYNLw7VXBj4fGR8 ]
Recent public activity
-
comment
Comment #49247930
In short, simplify the design to make it more reasonable for multiple implementations to agree while also adding intentional extensibility points and a governance model that allows…
-
comment
Comment #49233881
I'm working on an improved Markdown that offers a simplified language, clear hooks for extensibility, and a governance model to let it grow over time.
-
comment
Comment #49007921
An assert statement requires that you specifically come up with a test case. Lean lets you verify for all possible cases . Infinity is not a problem. It's similar to a type system …
-
comment
Comment #48846075
Without having any opinion on whether or not the Bun team was meaningfully fuzzing their codebase... Andrew's claim was not about whether or not they were, it was noting that the s…
-
comment
Comment #48845970
It's also a language of distancing from personal experience and honesty. Not saying you're wrong. Professionalism is an important tool for maintaining professional relationships. L…
-
comment
Comment #48545575
I think you've got it. You go in each day and work on things and talk with people working on things. There are multiple opportunities to share weekly, one or two are pretty regular…
-
comment
Comment #48531643
I'm working on an easy-to-embed typed language called Ekto. I am taking a lot of inspiration from Koka and aiming to support full multi-shot delimited continuations all while keepi…
-
comment
Comment #47981436
I was asking questions about compiler techniques. Then when I got annoyed I started asking about experimental design. Both were very frustrating experiences once I started realizin…
-
comment
Comment #47977958
All my usage of Grok for technical topics shows it regularly deeply misunderstanding things and just parroting back my question in fancy language. It’s the only frontier model I ge…
-
comment
Comment #46677754
I think, yes, with greater splat density—and, critically, more and better inputs to train on, others have stated that these performances were captured with 56 RealSense D455fs—then…
-
comment
Comment #46670863
Gaussian splatting is a way to record 3-dimensional video. You capture a scene from many angles simultaneously and then combine all of those into a single representation. Ideally, …
-
comment
Comment #46567369
Definitely not common! Nice to hear I'm not alone either. And yeah, I agree. Practically, it's the thing that annoys me the most day-to-day. I've mostly got wrapping set up to hand…
-
comment
Comment #46566325
I've recently begun replacing Markdown with Gemini's .gmi/gemtext format. It is Markdown with fewer features. I appreciate the simplicity and it's tremendously easy for custom tool…
-
comment
Comment #46027007
SDFs still scale by geometry complexity, though. It costs instructions to evaluate each SDF component. You could still use something like BvH (or Matt Keeter’s interval arithmetic …
-
comment
Comment #45739204
Genuine question, how does SPIR-V compare with CUDA? Why is SPIR-V in a trench coat less desirable? What is it about Metal that makes it SPIR-V in a trench coat (assuming that's wh…
-
comment
Comment #44996012
At the same time, if you want to use Claude to read the source and narrate how it works to you that’s trivial to do as a user.
-
comment
Comment #44490787
If you're familiar with Zorn's Lemma, the construction is just to order bases by inclusion and to consider chains created by noting that there must be an independent dimension and …
-
comment
Comment #44457984
Yeah, that's correct. You also often see it as having that for any method `X -> T ` there's a corresponding method `T -> T `. Or you can have that for any two arrows `X -> T ` and …
-
comment
Comment #44450039
Every monad is also an applicative and liftA2 does/is the same thing as liftM2. The only reason they both exist was due to Monad being popularized in Haskell earlier than Applicati…
-
comment
Comment #44449498
Monad tutorials are on the rise again. Let's start with function composition. We know that for any two types A and B we can consider functions from A to B, written A -> B. We can a…
-
comment
Comment #44447360
The more constrained your theory is, the fewer models you have of it and also the more structure you can exploit. Monads, I think, offer enough structure in that we can exploit thi…
-
comment
Comment #44310854
I’m not a huge fan of these, but this time I noticed that the best ones feel a lot like naturality arguments. As in, moving structural bits in a way that makes it clear that we’re …
-
comment
Comment #44273297
Often it's easy to construct a family of sets representing something of interest. For example, we like to define integration initially as a finite process of breaking the integrand…
-
comment
Comment #44147094
The quantification over T is still kind of weird, though. In a formulation like `for all T, (T and P consistent and T and neg P consistent)` is trivially false, just take `T = {neg…
-
comment
Comment #44127363
Yeah, I agree. "Independence" is fundamentally a property of the formal system you're working within (or really, it's a property of the system you're using and of the axiomatic sys…