frontpage.
newsnewestaskshowjobs

Open Source @Github

fp.

Is the Antminer Z15 Pro still worth buying in 2026?

https://www.z15pro860.com/blog-z15-pro-worth-buying-2026.html
1•RyanZPRO•1m ago•0 comments

Building self-improving agent loops

https://blog.oodle.ai/self-improving-agent-loops/
1•g_dhoot•1m ago•0 comments

Robin Farquharson: The Game Theorist Who Couldn't Solve Himself

https://thereader.mitpress.mit.edu/the-game-theorist-who-couldnt-solve-himself/
1•anarbadalov•3m ago•0 comments

Google Play Account Terminated

https://submitsafe.app/appeal-checker
1•igrik•3m ago•0 comments

Lighthouse Legal – Voice AI for personal injury intake

https://www.lighthouselegal.ai/
1•fkodom•5m ago•0 comments

How much should we worry about the pneumonic plague lableak in Siberia?

https://www.lesswrong.com/posts/TYfpTRxGH9frTymwN/how-much-should-we-worry-about-the-pneumonic-pl...
1•babelfish•7m ago•0 comments

European Processor Initiative Concluded

https://www.european-processor-initiative.eu/press-release-european-processor-initiative-successf...
2•doener•7m ago•0 comments

EU awards €180M tender for sovereign cloud to four European providers [pdf]

https://ec.europa.eu/commission/presscorner/api/files/document/print/en/ip_26_833/IP_26_833_EN.pdf
1•doener•7m ago•0 comments

ShinyHunters hacker in FBI data theft detained

https://www.reuters.com/world/middle-east/key-shinyhunters-hacker-detained-jordan-is-cooperating-...
1•ungut•11m ago•0 comments

Free AI Construction Estimating in the Web

https://www.supadocs.app/
1•reverseforward•11m ago•0 comments

OSDI '26 – Incr: Faster Re-Execution via Bolt-On Incrementalization [video]

https://www.youtube.com/watch?v=jYOL7kDUHA4
1•matt_d•12m ago•0 comments

Asana's Database Architecture: Sharding, Data Flow, and Scaling Tradeoffs

https://asana.com/inside-asana/database-architecture-sharding-scaling
1•pspeter3•12m ago•0 comments

Topological Models of Modal Logic

https://www.johndcook.com/blog/2026/10/04/topological-models-of-modal-logic/
1•ibobev•13m ago•0 comments

Modal Logic and Topology

https://www.johndcook.com/blog/2026/10/04/modal-topology/
1•ibobev•13m ago•0 comments

I quit my job to tell you stories hidden in satellite data

https://www.youtube.com/watch?v=JBA4v3D3p00
1•MaxLenormand•13m ago•0 comments

DHH shows Rust significantly outperforming other languages on Campfire

https://twitter.com/dhh/status/2106810173683851564
1•somerandomness•14m ago•0 comments

Creatine without exercise: Can it still help build muscle?

https://www.medicalnewstoday.com/articles/creatine-may-help-build-muscle-even-without-exercise-study
1•bilsbie•15m ago•0 comments

Agents Need Observability, Not Just Context

https://ateliti99.substack.com/p/agents-need-observability-not-just
1•olirex99•17m ago•0 comments

Give your LLM more DSLs

https://yasyf.com/writing/give-your-llm-more-dsls/
2•yasyfm•18m ago•0 comments

Driverless Cars and Human Error

https://www.skeptic.com/disabled_js/
1•jruohonen•19m ago•0 comments

Ask HN: Feedback regarding my AI setup

https://claude.ai/artifact/YVmnQojHNnSmijpVRtZ4xe
2•seifbenayed1992•20m ago•0 comments

Orcah Studio: A local-first video agent that can search your videos

2•iliashad•26m ago•2 comments

The Third Way of Using Linux

https://hisvirusness.com/third-is-the-way
2•speckx•26m ago•0 comments

Show HN: CoIsland – A local Mac app that monitors your dev tools and alerts you

https://coisland.app/
4•LeDonT•28m ago•0 comments

How much do coding agents spend rediscovering a codebase?

https://threadnote.io/whats-new/articles/graphmem-agent-continuation-study/
2•kashkovsky•29m ago•2 comments

Show HN: Reader Mode for Chrome

https://chromewebstore.google.com/detail/hush-a-beautiful-reader-m/ccpcpcolgkpbcljphckfcfigfbdjknpb
2•chandimab94•30m ago•0 comments

Show HN: An interactive electronic music graph

https://eweb.learningtodj.com/
2•devrob•30m ago•0 comments

Show HN: Halo – A Personal AI with On-Device Harness, Memory and Browser Agent

https://apps.apple.com/us/app/halo-personal-ai/id6783715054
1•tanmay007•32m ago•0 comments

The End of College as We Know It

https://www.wsj.com/opinion/the-end-of-college-as-we-know-it-e222ab3d
1•bilsbie•32m ago•0 comments

GitHub Actions Has Problems

https://www.githubstatus.com/incidents/3q1yb5m7ltvb
28•hising•34m ago•16 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