frontpage.
newsnewestaskshowjobs

Open Source @Github

fp.

Bonsaikitten.com

https://en.wikipedia.org/wiki/Bonsai_Kitten
1•tokai•2m ago•0 comments

All Soda Yearns to Be Red

https://haterade.substack.com/p/all-soda-yearns-to-be-red
1•mrkaye97•4m ago•0 comments

There's never been a better time to commit financial fraud

https://www.economist.com/business/2026/07/29/theres-never-been-a-better-time-to-commit-financial...
1•petethomas•7m ago•0 comments

Show HN: A local merge queue for parallel Claude Code agents

https://github.com/funador/claude-code-merge-queue
1•funador•9m ago•0 comments

Indie Web Directories

https://paultibbetts.uk/indieweb-directories/
1•Curiositry•10m ago•0 comments

Locust – Simple Open-Source Load Testing

https://locust.io/
1•Curiositry•11m ago•0 comments

A future where software self-improves and interacts with the physical world

https://3reate.com/podcast/everyones-a-billionaire-now-what/
1•andrewjneumann•12m ago•0 comments

For the cheap price of a permanent tatto, get access to job interview

3•NoRagrets•14m ago•1 comments

If Claude/Codex can connect via, what do we need a context layer for?

https://getunblocked.com/blog/mcp-connectors-are-not-a-context-engine/
4•dennispi•17m ago•0 comments

Ask HN: Is Claude (code) taking significantly longer to run tasks for anyone?

1•LostMyLogin•18m ago•0 comments

Show HN: Karrouet – Dots and Boxes game we used to play as kids in Tunisia

https://www.reddit.com/r/karrouet/
2•nirvanist•18m ago•0 comments

Mythos attack on 3rd-round PQC algorithm candidate puts it out of commission

https://arstechnica.com/security/2026/07/mythos-uncovers-crypto-weaknesses-that-went-unknown-for-...
3•jnord•19m ago•0 comments

Pokémon is turning to facial recognition scans to help combat scalpers

https://www.pcgamer.com/games/card-games/the-pokemon-company-is-turning-to-facial-recognition-sca...
2•Cider9986•20m ago•0 comments

Creator of Test That OpenAI Models Tried to Cheat Sounds Alarm

https://www.bloomberg.com/news/articles/2026-07-29/creator-of-test-that-openai-models-tried-to-ch...
2•sbulaev•22m ago•0 comments

The Vocabulary Bottleneck

https://moekhalil.substack.com/p/the-vocabulary-bottleneck
2•mfkhalil•22m ago•0 comments

Show HN: Mousecrack – Bypass bot detection with deep learning

https://github.com/puffinsoft/mousecrack
2•BeverlyHills001•23m ago•0 comments

Physicists Solve a Muon Mystery. Now, Old Results Don't Add Up

https://www.quantamagazine.org/physicists-solve-a-muon-mystery-now-old-results-dont-add-up-20260729/
2•jnord•23m ago•0 comments

Sell Your AI Skills?

https://capabase.ai/learn/sell-your-ai-skills
5•trebuh•28m ago•1 comments

Kimi K3's Design Secret May Be in Its Thinking Traces

https://notes.designarena.ai/kimi-k3s-design-secret-may-be-in-its-thinking-traces/
3•gmays•28m ago•0 comments

Show HN: Generate, Version and Host your resumé all via GitHub

https://github.com/sadigaxund/git-resume
1•sakhund•29m ago•0 comments

Largest battery storage in Germany set for partial commissioning

https://www.heise.de/en/news/Largest-battery-storage-in-Germany-set-for-partial-commissioning-113...
3•doener•31m ago•0 comments

Babe32 – Barely Adequate Browser ESP32

https://github.com/alunmorris/babe32-ESP32-web-browser-for-cheap-black-display
1•iamnothere•37m ago•1 comments

If you need plausible deniability, avoid devices that use wear-leveling

https://twitter.com/GrapheneOS/status/2082576645215412651
1•Cider9986•38m ago•1 comments

Meta shares drop on falling profits and weak sales forecast

https://www.ft.com/content/06d941ed-8136-46a4-a2ec-44bea1b35c3b
3•petethomas•39m ago•0 comments

The Pedagogy Behind the Studio

https://gail.wharton.upenn.edu/gen-ai-studio/the-generative-ai-studio-pedagogy/
2•ray__•40m ago•0 comments

The bond market to Kevin Warsh: What are you doing about inflation?

https://www.cnn.com/2026/07/29/business/bond-yields-fed-warsh
3•mapping365•43m ago•0 comments

Create multi-model coding workflows with Maestro

https://maestro-build.vercel.app/
2•Entropnt•44m ago•0 comments

US DOE to Convert Uranium Enrichment Facility into Data Center Campus

https://www.energy.gov/articles/energy-department-announces-partnership-expand-reliable-affordabl...
4•leecoursey•45m ago•3 comments

C++ float-to-int conversion can be undefined behavior

https://kttnr.net/blog/cpp-float-to-int-conversion-undefined-behavior/
3•Quentak•45m ago•0 comments

My Brain-Breaking Trick to Quit Using Facebook

https://tedium.co/2026/07/27/facebook-home-row-keyboard-trick/
2•latexr•51m ago•0 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