frontpage.
newsnewestaskshowjobs

Made with ♥ by @iamnishanth

Open Source @Github

fp.

Open in hackernews

Accidentally Turing-Complete

https://beza1e1.tuxen.de/articles/accidentally_turing_complete.html
25•bschne•8mo ago

Comments

panstromek•8mo 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•8mo 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•8mo 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_•8mo 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_•8mo 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•8mo 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•8mo 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

Skimfeed has changed it's url linking

1•markx2•2m ago•0 comments

MCP for a Coffee Machine... Worked!

https://archestra.ai/blog/brew-by-ai
1•motakuk•6m ago•0 comments

TS/JS Type-safe thread pool multithreading using Web Workers

https://github.com/imramkrishna/thready-js
1•handfuloflight•8m ago•0 comments

Show HN: A minimal demo showing coherence collapses when state is transported

https://github.com/jspchp63/rcircuit-phase-engine
1•jspchp63•9m ago•0 comments

I asked an AI to create "Unhackable Code". It gave me this. I'm scared

1•VOIDMAKINA•10m ago•2 comments

Show HN: certgrep – The Certificate Transparency Search Engine

https://certgrep.sh/
2•juxhindb•11m ago•0 comments

AMD Stole Intel's Future: The Untold x86-64 Story [video]

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

Manifesto claiming responsibility for terror attack on energy infrastructure [D]

https://www.berliner-zeitung.de/news/stromterror-in-berlin-das-bekennerschreiben-im-wortlaut-li.1...
1•FrojoS•12m ago•0 comments

Signal Contingency Plan (DeltaChat)

https://signal-contingency-plan.info/
1•xeonmc•12m ago•1 comments

DeGoogled Phones Reviews

https://tuta.com/blog/degoogled-phones
4•nreece•13m ago•0 comments

Directional Searching for Light Dark Matter with Quantum Sensors [pdf]

https://journals.aps.org/prl/abstract/10.1103/cwx5-2n1y
1•thunderbong•15m ago•0 comments

Show HN: I Built the Redis GUI Tool as an Alternative to RedisInsight - Redimo

https://www.redimo.dev
1•shh6155•21m ago•0 comments

Watching myself say things I would never say. Deepfake menace we must confront

https://www.theguardian.com/commentisfree/2026/jan/05/deepfakes-youtube-menace-yanis-varoufakis
2•defrost•21m ago•1 comments

ECB’s digital euro project faces decisive vote in 2026

https://www.ft.com/content/99a7b61b-c5df-4794-8c5f-2e3acd291333
1•nutjob2•27m ago•0 comments

Decorative Cryptography

https://www.dlp.rip/decorative-cryptography
19•todsacerdoti•32m ago•0 comments

Unifying QFT and GR Through Topologically Protected Gauge Theory

https://www.academia.edu/145737035/The_Renormalization_of_Gravity_Resolving_the_Goroff_Sagnotti_D...
1•MohskiBroskiAI•32m ago•0 comments

FL Studio Linux Setup Guide

https://github.com/Torbuntu/fl-studio-linux-setup
1•luckys•34m ago•0 comments

The Death and Rebirth of Programming – The Phoenix Architecture

https://aicoding.leaflet.pub/3malrv6poy22a
1•kiyanwang•37m ago•0 comments

The Naibbe cipher: encrypts Latin and Italian as Voynich-like ciphertext

https://www.youtube.com/watch?v=ByARtG-GUPo
1•omega3•37m ago•1 comments

Microsoft Office renamed to "Microsoft 365 Copilot app"

https://www.office.com
5•LeoPanthera•37m ago•2 comments

League of Legends Client rendered unusable after 10 year certificate expired

https://gamefragger.com/pc/moba/league-of-legends/league-of-legends-global-login-outage-expired-c...
1•dracotomes•39m ago•0 comments

Show HN: Spectra – Visuals should be infrastructure, not manual work

2•JannikJung•43m ago•0 comments

FreeBSD Home NAS, part 5: ZFS pools, datasets, snapshots, and monitoring ZFS he

https://rtfm.co.ua/en/freebsd-home-nas-part-5-zfs-pool-datasets-snapshots-and-zfs-monitoring/
2•todsacerdoti•44m ago•0 comments

Show HN: Kandinsky AI Video Generator

https://www.kandinskyai.com
1•Zach_HE•44m ago•0 comments

Swan Upping

https://en.wikipedia.org/wiki/Swan_upping
1•cyode•45m ago•0 comments

Voice Coding on iPad with Claude

https://www.youtube.com/watch?v=Rptvh534lI4
2•siwakotisaurav•46m ago•1 comments

What are some good designer agents available now?

1•nmr521521•47m ago•0 comments

Blade Runner: Braun HL 1 Personal Fan, En español (2012)

http://camara-de-maravillas.blogspot.com/2012/11/el-objeto-de-la-semana-ventilador-de.html
1•exvi•50m ago•0 comments

Ilya Sutskever

https://en.wikipedia.org/wiki/Ilya_Sutskever
3•doener•51m ago•0 comments

Secure, lint, and harden GitHub Actions workflows

https://github.com/reugn/github-ci
1•jrzx•55m ago•0 comments