frontpage.
newsnewestaskshowjobs

Open Source @Github

fp.

Show HN: Causal analyst agent skill for Claude

https://github.com/kiritbasu/causal-analyst
1•2au_observer•20s ago•0 comments

V2X2MAP: See the Cars Talk

https://v2x2map.com/
1•Eduard•1m ago•0 comments

A Decade of MakeCode

https://makecode.com/blog/10th-anniversary
1•azhenley•5m ago•0 comments

Sandbagged: Hoping to steal Nvidia chips, thieves mistakenly grab 20tons of sand

https://sfstandard.com/2026/09/25/plusai-autonomous-trucking-trailers-stolen-fremont/
1•giuliomagnifico•6m ago•0 comments

This Month in Redox – August 2026

https://www.redox-os.org/news/this-month-260831/
1•joshcsimmons•7m ago•0 comments

12,000-year-old Göbeklitepe burials explain scattered bones

https://archaeologymag.com/2026/09/gobeklitepe-burials-hundreds-of-scattered-bones/
1•yusufaytas•8m ago•0 comments

Shirei: Cross-Platform Immediate Mode GUI Framework for Go

https://judi.systems/shirei/
2•thunderbong•15m ago•0 comments

One Month Without AI

https://blog.bustikiller.com/2026/09/25/one-month-without-ai.html
1•saibotk•16m ago•0 comments

Court rules Trump can blacklist Anthropic for refusing to enable Claude features

https://arstechnica.com/tech-policy/2026/09/court-rules-trump-can-blacklist-anthropic-for-refusin...
1•sbulaev•17m ago•0 comments

A Tutorial on the Cross-Entropy Method [pdf]

https://web.mit.edu/6.454/www/www_fall_2003/gew/CEtutorial.pdf
1•ronfriedhaber•22m ago•0 comments

How do I deal with my team members who are resisting change?

https://andiroberts.com/leadership-questions/team-members-resisting-change
1•fagnerbrack•23m ago•0 comments

Are US Cannabis Contracts Enforceable?

https://businessofcannabis.com/are-us-cannabis-contracts-enforceable-a-32m-court-ruling-just-said...
1•lifeisstillgood•24m ago•0 comments

The weaker he gets, the more dangerous he gets

https://www.theguardian.com/news/ng-interactive/2026/sep/25/trump-lashes-out-un-fed-supreme-court
1•classified•26m ago•0 comments

The Copilot+ PC brand is dead

https://www.windowscentral.com/microsoft/windows-11/the-copilot-pc-brand-is-dead-microsoft-and-pc...
2•bj-rn•29m ago•1 comments

First DVD player announced Sept 26, 1996

https://dfarq.homeip.net/first-dvd-player-announced-sept-26-1996/
1•giuliomagnifico•29m ago•0 comments

Drum Machines (LLMs) Have No Soul

https://calvinflegal.com/2026/09/26/drum-machines-have-no-soul.html
1•calflegal•32m ago•1 comments

How to keep enjoying programming in a world of LLMs

https://discourse.haskell.org/t/how-to-keep-enjoying-programming-in-a-world-of-llms/14705
33•signa11•42m ago•22 comments

Ask HN: Indie hackers on X (Twitter) feels like a mega bubble these days

1•sankalpdomore•48m ago•0 comments

The Emacs Cat: Running Emacs in MicroVM

https://olddeuteronomy.github.io/post/running-emacs-in-microvm/
1•hndhyc0bdt•51m ago•0 comments

According to 1950s futurists, women of the year 2000 would be giantesses (2012)

https://gizmodo.com/according-to-1950s-futurists-women-of-the-year-2000-wo-5878243
1•Eridanus2•51m ago•0 comments

Overpaying for AWS Managed Nat Gateways? Fck-Nat

https://fck-nat.dev/v1.4.0/
2•edweis•54m ago•0 comments

Show HN: Aerofi – a rofi-inspired, scriptable launcher for macOS (Rust, GPUI)

https://github.com/frostymur/aerofi
1•osaill•54m ago•0 comments

I am the only one who still uses sublime text daily?

2•serg2•54m ago•0 comments

Show HN: App2Api – Give your AI the API behind your app

https://app2api.com/
1•flkdnfsnsf•57m ago•0 comments

Writing a Theorem Prover from Scratch

https://astledsa.substack.com/p/writing-a-theorem-prover-from-scratch
2•astledsa•58m ago•0 comments

Flashcat – a local AI assistant for the Mac terminal that asks first

https://github.com/TomTomsen765/flashcat
1•TomTomsen•1h ago•0 comments

An Epyc trip to Venice: about AMD's 256-core monster chip

https://www.theregister.com/systems/2026/09/23/an-epyc-trip-to-venice-everything-we-do-and-dont-k...
1•pella•1h ago•0 comments

Srijan Orizon – South Kolkata's Upcoming Landmark Project

1•Liyaans•1h ago•0 comments

Fifteen years later, the Apple Cards origin story

https://lexontech.org/fifteen-years-later-the-apple-cards-origin-story
6•ksec•1h ago•0 comments

Nintendo Wins $4.5M Judgment Against R/SwitchPirates Mod 'Archbox'

https://torrentfreak.com/nintendo-wins-4-5-million-judgment-against-r-switchpirates-mod-archbox/
2•gslin•1h ago•1 comments
Open in hackernews

Accidentally Turing-Complete

https://beza1e1.tuxen.de/articles/accidentally_turing_complete.html
25•bschne•1y ago

Comments

panstromek•1y ago
Nice list. Some of those are arguably not accidental, TypeScript type system seems kinda obvious to be turing complete when it tries to describe dynamically typed langauage.
WalterGR•1y ago
x86 MOV instruction: “The mov-only DOOM [game] renders approximately one frame every 7 hours, so playing this version requires somewhat increased patience.”
a_cardboard_box•1y ago
Rule 110 is only Turing-Complete if you have an infinitely large array of cells, and are able to initialize it with an infinite repeating pattern. If I'm not mistaken, HTML+CSS can only do a fixed-sized array.

With a Turing-Complete language, if a program runs out of memory on one machine, you can run the same code on a bigger machine without modifying it, and it can use the additional memory. With fixed-length rule 110, you need to modify the code if you want to use more memory.

256_•1y ago
This is addressed in the second paragraph of TFA:

"Stuff which is somehow limited (stack overflows, arbitrary configuration, etc) is still considered Turing complete, since all "physical" Turing machines are resource limited."

In my opinion, worrying about infinite memory, in regards to Turing completeness, makes the task of implementing computation much less interesting.

Also, I'm pretty sure CSS only does one generation (or a finite number of them) before stopping anyway.

256_•1y ago
Logic in Doom is particularly interesting to me. Apparently you can fit ~64k logic gates in a map (using the method described). From [1]:

"As the DOOM engine was not designed to be an interpreter, there are some constraints on our programs written against it. The biggest one is how large our programs can be. Since each gate uses at least one tag, we can use this as a metric to derive an upper-bound on the size of a program. As the DOOM engine uses 16-bit tags, this means we can have, at most, 65535 gates. This is not a particularly large number. We may be able to implement a very small CPU but this limit will be hit pretty quickly I believe."

The z80 had ~8,500 transistors. The 8086 had ~29,000 (checking Wikipedia). You could get far fewer if you use a 1-bit microarchitecture, I'm sure. I think there was a DEC (PDP?) computer that used that trick to have a really low transistor count, but I don't remember what it was called.

The real problem is RAM; for this you may as well cheat and modify Doom's code to add a RAM chip, and I/O while you're at it.

You could create a CPU in Doom implementing an architecture for which a C compiler exists, capable of compiling Doom, and run it in the CPU in Doom. For "reasonable" speed you'd have to do more than one simulation step per frame render (in the host Doom). If you ran it for long enough maybe you could get a full frame of Doom in Doom.

[1]: https://calabi-yau.space/blog/doom.html

karmakaze•1y ago
Doom running in TypeScript static type checker[0].

> half trillion lines of types totaling 177 terabytes ran through the type checker around the clock for 12 days to get the first frame

[0] https://news.ycombinator.com/item?id=43184291

karmakaze•1y ago
My favorite one is Conway's Game of Life. It's perhaps the least surprising one, but it's also the most visually appealing. Really like this video that leads up to making the Game of Life in itself[0]. It's something you can show a non-technical person and they can get a sense of how crazy it is that something so simple can do anything.

[0] https://www.youtube.com/watch?v=Kk2MH9O4pXY