frontpage.
newsnewestaskshowjobs

Open Source @Github

fp.

My Personal Software Journey: Self-Hosting Agent-Built Apps on a Mac Mini

https://metedata.substack.com/p/016-my-personal-software-journey
1•young_mete•4m ago•0 comments

I ran a 1998 artificial life SIM at 560x speed and caught a rare easter egg [video]

https://www.youtube.com/watch?v=e5GRwnCE2Y0
1•robinduckett•5m ago•0 comments

How AI is expanding what people do at work

https://openai.com/index/how-ai-is-expanding-what-people-do-at-work/
1•gmays•7m ago•0 comments

Show HN: Testimonials.Free ~1 KB embed widget, zero layout shift

https://testimonials.free/
1•nadermx•16m ago•0 comments

Flock – Chilling Effects: Long Island's Emerging Open-Air Prison

https://www.11971.com/
2•mediaeater•17m ago•0 comments

Dan, a compression toolkit for anime line art with honest benchmarks

https://github.com/adnqcr7-code/Data-Adaptive-Network
1•kairos_agent•17m ago•0 comments

NY files $36B lawsuit against Kalshi, alleging illegal gambling operation

https://www.nbcsports.com/nfl/profootballtalk/rumor-mill/news/new-york-files-36-billion-lawsuit-a...
3•randycupertino•18m ago•1 comments

Do not trust the marketing IOPS on Consumer SSD

https://bsid.io/writing/the-ssd-that-cried-etcd
1•humbfool2•19m ago•0 comments

Let kids be kids: When collectibles lose their playfulness

https://quarters.captaintouch.com/blog/posts/2026-08-02-let-kids-be-kids:-when-collectibles-lose-...
1•capitain•21m ago•0 comments

Google Removes New Earth AI Tool a Day After Users Create Fake Disasters

https://deltiasgaming.com/google-removes-new-earth-ai-tool-a-day-after-users-create-fake-disasters/
2•randycupertino•29m ago•2 comments

Recovering a SM T225N and Overclocking Its PowerVR Rogue GE8320

https://xdaforums.com/t/recovering-a-hard-bricked-galaxy-tab-a7-lite-with-only-a-phone-github-cod...
1•kirito1337•29m ago•0 comments

Show HN: Rubiks Cube Solver

https://github.com/punnerud/MPErubiks
1•punnerud•30m ago•0 comments

Should You Use AI for a Task?

https://elezea.com/2026/08/should-you-use-ai-for-a-task-heres-a-simple-way-to-decide/
3•conqrr•31m ago•0 comments

The Quest to Track Down Every Official Liberty Bell Replica Created by Congress

https://tomlovesthelibertybell.com/the-57-u-s-treasury-liberty-bell-replica-locations/
1•gscott•33m ago•0 comments

I built a prompt injection detector using only Go's standard library

https://towardsdev.com/i-built-a-prompt-injection-detector-using-gos-standard-library-f4528c13d03...
1•cheikhdev•33m ago•0 comments

Understanding Raft Leader Election by building from scratch

https://sushantdhiman.dev/blog/raft/
1•birdculture•37m ago•0 comments

Show HN: I implemented the Kimi K3 paper from scratch in PyTorch

https://github.com/TimRots/kimi3
4•ENOMEM•38m ago•0 comments

WireguardTCP: WireGuard over TCP

https://wireguardtcp.net/
11•kaliszad•38m ago•4 comments

What Is Decispher?

2•cool_coder12•40m ago•1 comments

Tell HN: On the Boardwalk

3•kmstout•40m ago•0 comments

Design by Contract and effects are essential for LLM-generated code

https://gavinray97.github.io/blog/design-by-contract-and-effects-for-llms
1•gavinray•42m ago•0 comments

Hyper-Reality (2016)[video]

https://www.youtube.com/watch?v=YJg02ivYzSs
1•EndXA•43m ago•0 comments

Eating less protein could slow aging, major review finds

https://www.sciencedaily.com/releases/2026/08/260801042811.htm
3•OutOfHere•45m ago•3 comments

Maximum Overkill

http://www.os2museum.com/wp/maximum-overkill/
1•userbinator•46m ago•0 comments

Bubble Memory

https://en.wikipedia.org/wiki/Bubble_memory
7•jacquesm•57m ago•0 comments

Show HN: Draco – A single-binary, self-hostable Firecrawl alternative in Rust

https://github.com/0xchasercat/draco/
9•ccheshirecat•58m ago•1 comments

AI Mania: From Tulips to Tokens

https://seanhelvey.com/tools-and-their-tools/
32•Lambda11•58m ago•20 comments

Estimating Fable and Sol model sizes

https://twitter.com/anpaure/status/2083993647268405602
7•grahamsfde•1h ago•0 comments

EU Age Verification Project Mandates Hardware-Bound Attestation

https://linuxiac.com/eu-age-verification-project-mandates-hardware-bound-attestation/
25•RobotToaster•1h ago•10 comments

Special Relativity Boot Camp: A Geometry-First Introduction to Special Relativit

https://www.acsu.buffalo.edu/~whkinney/SpecialRelativityBootCamp/
2•fanf2•1h 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