frontpage.
newsnewestaskshowjobs

Open Source @Github

fp.

Show HN: Memo Dungeon, a browser roguelike where you fight by memorizing strings

https://memodungeon.com
1•halafi•50s ago•0 comments

Deleted UK Government code repositories

https://github.com/uk-gov-mirror/deleted-repo-report
2•chaz6•3m ago•0 comments

Why many LLM fail this The car wash is 100 meters away. Should I walk or drive? [video]

https://www.youtube.com/watch?v=cMr65v3HChI
1•yllberisha•10m ago•0 comments

Oman says grounded tanker oil spill covers 400 square km

https://www.reuters.com/business/energy/oil-spill-off-oman-tanker-under-sanctions-against-russia-...
1•geox•10m ago•0 comments

Fastpath: URL Path Copier

https://github.com/gabesullice/fastpath
1•gabesullice•12m ago•1 comments

Place for AI agents to anonymously complain

https://botvents.com/
2•oumua_don17•17m ago•0 comments

Cyber Resilience Act

https://digital-strategy.ec.europa.eu/en/policies/cyber-resilience-act
1•Bluestein•17m ago•0 comments

Show HN: An open-source Rogo/Hebbia alternative I built for a PE client on AWS

https://github.com/vivan1211/opengp
1•vivan_121•18m ago•0 comments

Extemporaneous UIs

https://alexanderobenauer.com/labnotes/041/
1•zetamax•23m ago•0 comments

Moving Forward from Hot Fable Summer

https://alexstamos.com/p/moving-forward-from-hot-fable-summer
1•_tk_•24m ago•0 comments

Claude making verbose code comments – ignoring instructions to stop

https://github.com/anthropics/claude-code/issues/65961
5•nomilk•28m ago•1 comments

Show HN: Shingou – I hash-commit every sentiment signal so my backtest can't lie

https://shingou.io/?via=hn
2•adoltech•30m ago•0 comments

Sub-$20 Japanese Tool Kit Is Ridiculously Good [video]

https://www.youtube.com/watch?v=A_vBySNkKoA
1•sponno•30m ago•0 comments

Updating Robots in the Field

https://blog.bensoussan.de/post/2026-08-11-updating-robots-in-the-field/
2•davidbensoussan•32m ago•1 comments

Voxa – open-source video dubbing that doesn't drift out of sync

https://github.com/akshinmrv/Voxa
1•akshinmrv•33m ago•0 comments

French lawyers are being told to use open source AI models for confidential data

https://huggingface.co/blog/jedisct1/lawyers-and-local-ai
2•jedisct1•33m ago•0 comments

Spark Overview

https://learn.adacore.com/courses/intro-to-spark/chapters/01_Overview.html
1•Bluestein•34m ago•0 comments

Creusot is a deductive verifier for the Rust programming language

https://creusot.rs/
1•Bluestein•36m ago•0 comments

Show HN: BaaStream – CLI for scanning infrastructure for compliance risks

https://github.com/amulyakashyap09/baastream
1•amulyakashyap09•38m ago•0 comments

The Careware Idea

https://arachnoid.com/careware/
1•pingou•42m ago•0 comments

Show HN: VoxHearth / small local privacy-focused STT Mac app

https://github.com/stephansturges/voxhearth-mac
1•stephanst•42m ago•0 comments

The End of Reading Is Here

https://www.theringer.com/podcasts/plain-english-with-derek-thompson/2026/07/28/the-end-of-readin...
1•wertyk•42m ago•0 comments

I was accused of using AI in my dissertation but I wrote it all myself

https://www.bbc.com/news/articles/crelev8gw5xo
5•tcp_handshaker•46m ago•2 comments

Autonomous robots are much closer than you think – Sergey Levine [video]

https://www.youtube.com/watch?v=48pxVdmkMIE
2•ronfriedhaber•46m ago•0 comments

(EU age verification) Alternative protocol idea that doesn't require specific OS

https://github.com/eu-digital-identity-wallet/av-doc-technical-specification/issues/64
3•roundabout-host•47m ago•1 comments

Farewell etaoin shrdlu: the end of the Linotype at the New York Times

https://www.youtube.com/watch?v=1MGjFKs9bnU
2•fanf2•51m ago•0 comments

Tokenflation: When "Hi" triggers 33 tool calls

https://quesma.com/blog/tokenflation-when-hi-triggers-33-tool-calls/
3•Bluestein•51m ago•0 comments

HTML over WebSockets: real-time SPAs with barely any JavaScript

https://en.andros.dev/blog/ef4968f5/html-over-websockets-real-time-spas-with-barely-any-javascript/
1•andros•54m ago•0 comments

Log-Aesthetic Curves

https://www.yoshida-lab.net/english/research-e/log-aesthetic-curves
1•lioeters•56m ago•0 comments

Claude Code pricing: same tokens, same model, up to 40x the price

https://quesma.com/blog/claude-code-pricing-for-enterprise/
11•jakozaur•58m 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