The collapse in production costs from AI video is going to change the volume and quality of what gets made. We’re headed for a world where studios and small teams alike can produce work that would have required a Game of Thrones budget not long ago. The pipeline for high end series and films is about to get a lot bigger, and the pace of experimentation is going to jump
Readit NewsOldGreenYodaGPT commented on The Walt Disney Company and OpenAI Partner on Sora openai.com/index/disney-s... · Posted by u/inesranzo
OldGreenYodaGPT commented on Sam Altman’s DRAM Deal mooreslawisdead.com/post/... · Posted by u/pabs3
More anti sam anti AI propaganda, nothing dirty about this deal
OldGreenYodaGPT commented on Using Generative AI in Content Production partnerhelp.netflixstudio... · Posted by u/CaRDiaK
Netflix is basically strangling the creative potential of GenAI before it can even breathe. Their new “guidelines” read like a corporate legal panic document, not a policy for innovation. Every use case needs escalation, approval, or a lawyer’s blessing. That’s not how creativity works.
The irony is rich they built their empire on disrupting old Hollywood gatekeeping, and now they’re recreating it in AI form. Instead of letting creators experiment freely with these tools, Netflix wants control over every brushstroke of ai creativity
OldGreenYodaGPT commented on Show HN: A CSS-Only Terrain Generator terra.layoutit.com... · Posted by u/rofko
Crazy that vibe coding can make things like this now! 2026 going to be crazy! There is no AI bubble
Dead Comment
OldGreenYodaGPT commented on 987654321 / 123456789 johndcook.com/blog/2025/1... · Posted by u/ColinWright
Definitions:
denom(b) = (b^b - b^2 + b - 1) / (b - 1)^2
num(b) = (b^b(b - 2) + 1) / (b - 1)^2
Exact relation: num(b) - (b - 2)
denom(b) = b - 1Therefore: num(b) / denom(b) = (b - 2) + (b - 1)^3 / (b^b - b^2 + b - 1) [exact]
Geometric expansion: Let a = b^2 - b + 1. 1 / (b^b - b^2 + b - 1) = (1 / b^b) * 1 / (1 - a / b^b) = (1 / b^b) * sum_{k>=0} (a / b^b)^k
So: num(b) / denom(b) = (b - 2) • (b - 1)^3 / b^b • (b - 1)^3 * a / b^{2b} • (b - 1)^3 * a^2 / b^{3b} • …
Practical approximation: num(b) / denom(b) ≈ (b - 2) + (b - 1)^3 / b^b
Exact error: Let T_exact = (b - 1)^3 / (b^b - b^2 + b - 1) Let T_approx = (b - 1)^3 / b^b
Absolute error: T_exact - T_approx = (b - 1)^3 * (b^2 - b + 1) / [ b^b * (b^b - b^2 + b - 1) ]
Relative error: (T_exact - T_approx) / T_exact = (b^2 - b + 1) / b^b
Sign: The approximation with denominator b^b underestimates the exact value.
Digit picture in base b: (b - 1)^3 has base-b digits (b - 3), 2, (b - 1). Dividing by b^b places those three digits starting b places after the radix point.
Examples: base 10: 8 + 9^3 / 10^10 = 8.0000000729 base 9: 7 + 8^3 / 9^9 = 7.000000628 in base 9 base 8: 6 + 7^3 / 8^8 = 6.00000527 in base 8
num(b) / denom(b) equals (b - 2) + (b - 1)^3 / (b^b - b^2 + b - 1) exactly. Replacing the denominator by b^b gives a simple approximation with relative error exactly (b^2 - b + 1) / b^b.
OldGreenYodaGPT commented on React vs. Backbone in 2025 backbonenotbad.hyperclay.... · Posted by u/mjsu
in 2025 React is much much better then Backbone
Dead Comment
with Codex and Claude Code there is no reason to use Cursor
Tools like Claude Code and OpenAI’s Codex CLI have boosted my productivity massively. They already handle about 90% of the coding work, and I just step in to finish the last 10%. Every month they get better, maybe in a year it’s 95%, in two years 97%, in three years 98%. We can all see where this is going.