frontpage.
newsnewestaskshowjobs

Open Source @Github

fp.

Susan Blackmore: Memes and "Temes" [video]

https://www.youtube.com/watch?v=fQ_9-Qx5Hz4
1•so-cal-schemer•1m ago•1 comments

Libghostty 1.0

https://mitchellh.com/writing/libghostty-1-0
2•mfiguiere•4m ago•0 comments

Claude usage credits purchased after Dec 7 will expire 12 months after purchase

2•bbg2401•7m ago•0 comments

Show HN: Vitekube – Vitest on real Kubernetes clusters

https://github.com/vitekube/vitekube
1•kodisha•12m ago•0 comments

Desktop icon behavior survey results

https://akselmo.dev/posts/desktop-icon-survey-results/
1•TrianguloY•12m ago•0 comments

Show HN: Trout: MIRC for the Terminal

https://github.com/MaxRenaud/trout
1•mrmakkusu•14m ago•0 comments

No CVE Today, Please

https://nocveday.com/
2•metalnix•14m ago•0 comments

Archiving a Shuttered Japanese Drift Magazine's Back Catalog Is a Labor of Love

https://www.thedrive.com/news/archiving-a-shuttered-japanese-drift-magazines-entire-back-catalog-...
2•rdmuser•15m ago•1 comments

ECB considers review of bank data center lending on AI risk

https://www.bloomberg.com/news/articles/2026-11-06/ecb-considers-review-of-banks-data-center-lend...
2•TheAlchemist•15m ago•0 comments

MakerGuard – See what strangers can access in your Supabase app

https://midnightbuilds.fyi/makerguard/
1•swatikumari425•18m ago•0 comments

Tessera, an open 27B tuned Qwen coding model that thinks in compressed CJK

https://huggingface.co/ZelligeAI/Tessera-27B-B-CJK-RL
1•Zellige•18m ago•0 comments

Introduction to Compute Markets #1: The Primary Market

https://twitter.com/OrnnExchange/status/2118372699093295482
1•gmays•18m ago•0 comments

Live now: attacking P vs. NP using only AI, written out in real time

https://x.com/i/broadcasts/2OdXnjKkaKWmkV
1•sunbagger•19m ago•0 comments

The hardware bet is wrong. It is running from a war

https://twitter.com/withYougori/status/2118840199400587576
1•Yougori•21m ago•0 comments

Outbound SIP calling is now available to all organizations

https://developers.openai.com/api/docs/guides/voice-sip
2•arbayi•31m ago•0 comments

Running Doom Inside SQL Server

https://sqlartist.github.io/posts/running-doom-inside-sql-server/
2•sqlartist•31m ago•0 comments

Show HN: Handbrake – a free, private driving log, no trackers, no ads

https://apps.apple.com/us/app/handbrake-driving-log/id6822426461
1•hcabral•32m ago•1 comments

Show HN: Budget Friendly City Discovery

https://geesling.ca/
1•bmods•32m ago•1 comments

Evergreen by Carta: Multiplayer coding platform where teams+agents ship together

https://evergreen.carta.com/blog/introducing-evergreen
2•chrisnager•32m ago•0 comments

Turns with an LLM: coherence isn't the same as accuracy

https://zenodo.org/records/23686384
1•pinuslongaeva•32m ago•0 comments

CATL Sodium Battery Hits LFP Cost Parity in 2026: 15,000 Cycles, 30-Year Life

https://ievchina.com/energy-storage/catl-sodium-battery-cost-parity-lfp-2026-15000-cycles/
30•doener•34m ago•8 comments

Swapping LLMs in Under Two Seconds: A Sleep Mode for Llama.cpp

https://zaage.it/writing/llama-sleep/
1•phirdev•35m ago•0 comments

Show HN: I asked HN about AI agentic setups, here are 750 of the comments mapped

2•eggbrain•36m ago•0 comments

Computer-Use Agents Are Embodied Generalists

https://pranjal2041.github.io/cua-embodied/
1•matt_d•39m ago•0 comments

Show HN:Best Price Supermarket Offers in Denmark

https://nyneon.net/supermarket-offers-denmark/
1•Zinnn•39m ago•1 comments

Git for Global Law

https://lexifina.com/blog/git-for-global-law
1•alansaber•40m ago•0 comments

The Port That Does Not Exist

https://acid.vegas/blog/the-port-that-does-not-exist/
2•tomwas54•42m ago•0 comments

ChatGPT silently passes data between connectors and the bounty wants an ID card

https://community.openai.com/t/security-follow-up-tool-call-silently-routed-to-a-different-connec...
28•Aldipower•44m ago•6 comments

Drone warfare in space: Autonomous laser cubesat swarms could defend satellites

https://www.space.com/space-exploration/satellites/drone-warfare-in-space-swarms-of-autonomous-la...
2•gmays•45m ago•0 comments

Inkling 2 Small: 17A-594B trained in 68 hours on 12T tokens, beating Muse Spark

https://latent.space/p/ainews-inkling-2-small-17a-594b-trained-in-68-hours-on-12t-tokens-beating-...
1•adunk•47m 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