hwpythonner

Really neat proof of concept—I’m just trying to understand what tradeoffs come with bending general-purpose tasks into the NPU shape.

One thing I’m curious about: when expressing algorithms like this as static computation graphs, does that change their computational complexity in any meaningful way? For example, could certain problems end up with worse asymptotic behavior (O(n²) instead of O(n log n)) due to being flattened into a fixed graph with no branching or dynamic control?

Depends. Usually a mix of comments in the code before committing, text files, markdown notes, and whatever internal task system we’re using (Jira-style).

I haven’t found a silver bullet that makes all of that feel cohesive. It's usually a balance between “what’s fast right now” and “what future me might understand.”

I’m trying to understand if this depends on something specific to FM or TV signals, or if it’s more of a protocol-level idea (i.e., any time-synced, known-location transmitters would work).

If it’s not intrinsic to FM, why not use existing cellular towers to do this? They’re everywhere, and phones already receive broadcast messages (like Amber Alerts) even without a SIM (I think) — so it feels like this could be done without needing new radios.

What makes this more accurate than cell tower triangulation today? Is the limitation in timing sync across towers, or something else in how cell networks are structured?

And for indoor use — how does this handle multipath? Reflections from walls or even atmospheric bounce seem like they’d throw off timing accuracy, similar to what messes with GPS in dense areas.