prideout

Ah, the complement to TROFF.

That all sounds right to me, but apparently they can also be used for simply generating videos, or "unlocking the creation of new interactive experiences"... which both seem like competing goals with everything you just mentioned.

Is this post popular because of a recent mathematical discovery in this problem space?

I see your point for the bike scenario, but not for choosing a paint colors or touring a city (the other scenario in the ad). The common element that I perceived was that these were all mundane tasks in the physical world.

I find the video strange. Are we meant to empathize with people who get flummoxed by everyday life? "Oh woe is me, I can neither assemble a bike nor ask a friend for help!" Of all the challenges in my life, the tiny mundane ones are the ones that can be most fun; those are the opportunities to laugh at myself, and to revel in small & happy victories. It's the charm of life.

This includes a proof of Barnette's Conjecture, which is one of the graph theory conjectures that I tried attacking with SOTA models a few months ago. I like it because it is easy to understand with a basic knowledge of graph theory. I spent quite a bit of time on it and failed. Their proof looks approachable at first glance.

https://github.com/openai/math/blob/main/preprints/Paired-st...

These are amazing but the parent comment is referring to vision comprehension, not generation.

Me too but unfortunately theorem proving seems to be easier than doing laundry.

There's also https://github.com/google/filament

What was the prompt?

But aren't today's frontier models already "fully universal"? To use your Turing machine analogy, I think we're past the calculator stage.

Super useful, and easy to do in the VS Code merge pane.

They were speaking from an implementation perspective.

Ah, I see it as a "reasoning level" in codex after typing /model

Confused about how to access Ultra; I don't see it in on their plans page.

Kolmogorov Complexity looks interesting. It seems to formalize Occam’s Razor and the notion that intelligence = compression.

This is a fascinating mathematical framework, but the post title might be a bit of an overreach. I often wonder if "a theory of deep learning" could exist that could be stated succinctly and that could predict (1) scaling laws and (2) the surprising reliability of gradient descent.

Note that I said "predict" not "describe". It feels like we're still in the era of Kepler, not Newton.

Yes! My first encounter with spreadsheets was SuperCalc for CP/M, and I suppose you would call it a "TUI" nowadays.

What does the "Session Picker" section refer to? Claude Code does not have a session picker, as far as I can tell.

Neat. Would be nice if I could easily drop the replayer into a slack thread. Maybe a video file would be better for that than an HTML file?

This is not written by a former Google employee, it's written by a former Google user. Confusing title to see on hackernews.

Why is Minecraft mentioned several times in the post?

This post is well written, useful, and original. I'm surprised by the negative comments.

Neat but I would prefer simply using a dylib for the part of my code that I want to be reloadable.

I have never seen a Koreeda film but he sounds compelling -- which movie would you recommend for a first-timer?

Did you need to write an app for the phone?

There's less ageism in embedded systems because older folks are more likely to be experienced with a lean & mean tech stack (for example vanilla C programming).

Currently we simply copy a slice of the heap's ArrayBuffer from WASM to JS. In the past we exposed the heap slice directly but it was technically "unsafe" (perhaps because the heap can grow), and doing a copy did not hurt performance in any measurable way.

The fact that triangles have proliferated is not due to half-assery. Hardware can rasterize them very quickly, and a triangle can have only one normal vector. Quads can be non-planar. It's true that quads are nice for humans and artists though!

As an aside, Catmull-Clark subdivision has been around since 1978, which, as a first step, breaks an arbitrary polyhedron into a mesh of quadrilaterals.

nm, found a nice open source one:

https://github.com/downforacross/downforacross.com