frontpage.
newsnewestaskshowjobs

Open Source @Github

fp.

Google Can't Math Parsecs

https://www.lesswrong.com/posts/BmqzjcD4tGvy3bim8/google-can-t-math-parsecs
1•ubutler•5m ago•0 comments

How the AI Village Works

https://theaidigest.org/village/blog/how-the-ai-village-works
1•vinhnx•8m ago•0 comments

How Does One Brain Speak Two Languages?

https://www.nytimes.com/2026/06/15/science/brain-language-grammar.html
1•ripe•8m ago•0 comments

They Looked Like They Were Getting Rich on Polymarket–But None of It Was Real

https://www.wsj.com/business/media/polymarket-social-media-bets-prediction-market-441cdeb5
1•Vaslo•9m ago•0 comments

Parody Symbolics Lisp Machines software release (1982)

https://groups.google.com/g/comp.sys.ti.explorer/c/2sI_2_eOWug
1•gnodar•9m ago•0 comments

When I reject AI code even if it works

https://vinibrasil.com/when-i-reject-ai-code-even-if-it-works/
2•vnbrs•23m ago•1 comments

Show HN: GenAIDojo

https://www.genaidojo.io/
1•aniketwattawmar•29m ago•0 comments

An Apology for Idlers by Robert Louis Stevenson (1877) [video]

https://www.youtube.com/watch?v=a4T9pbxrlfw
2•SpiralLibrarium•32m ago•0 comments

Subquadratic claims it broke through a bottleneck that's holding back LLMs

https://www.technologyreview.com/2026/06/19/1139313/a-startup-claims-it-broke-through-a-bottlenec...
1•baddash•33m ago•0 comments

RocketAnalyzer · Streamlit

https://rocketanalyzer-ca7wd4a54c7sxjiuk6aewi.streamlit.app
1•ApplePanda03•36m ago•0 comments

Show HN: Rocannon – Any Ansible module to MCP Tool, record sessions as playbooks

https://github.com/msradam/rocannon
2•msradam•41m ago•0 comments

Adobe adds its AI assistant to Premiere, Illustrator, and InDesign

https://techcrunch.com/2026/06/18/adobe-adds-its-ai-assistant-to-premiere-illustrator-and-indesign/
2•breve•41m ago•0 comments

VibeThinker 3B – Taking on Giant Models [video]

https://www.youtube.com/watch?v=_a9Vv5dfW24
2•modinfo•47m ago•0 comments

A Visit to id Software ft Bobby Prince (1993) [video]

https://www.youtube.com/watch?v=HpEBUV_g9vU
3•qmr•56m ago•0 comments

The History of TypeScript

https://www.visualsource.net/repo/github.com/microsoft/typescript
3•pro_methe5•1h ago•0 comments

Show HN: Rlsgate – Block the Supabase RLS leak before you deploy (CLI)

https://github.com/GerardoRdz96/rlsgate
4•gerardordz96•1h ago•0 comments

'We had to get out of the way': The backlash over delivery robots

https://www.bbc.com/news/articles/c0rygp005wjo
4•higginsniggins•1h ago•0 comments

Project Fetch: Phase Two

https://www.anthropic.com/research/project-fetch-phase-two
21•stopachka•1h ago•1 comments

Pondering routing more of my traffic via nodes outside the UK

https://neilzone.co.uk/2026/06/pondering-routing-more-of-my-traffic-via-nodes-outside-the-uk-beca...
3•ColinWright•1h ago•0 comments

Show HN: Agentic coding workflows built on Git worktrees and task evidence

https://github.com/alex-reysa/glueRun-go
4•alexreysa•1h ago•0 comments

Show HN: Money Simulator

https://simulator.money/play
2•pattle•1h ago•1 comments

Show HN: Codeflowmap – map a codebase's read/write/auth data flows

https://github.com/man-consult/code-mapper
2•brian-m•1h ago•0 comments

Beyond the $7.4B Headline: DeepSeek's Series A signals Chinese AI alliance shift

https://asiaai.fyi/east-asias-ai-capital-surge-homegrown-models-challenge-west-amid-mineral-tensi...
2•dweisinger•1h ago•0 comments

LiveKit Solves Turn Detection

https://livekit.com/blog/solving-end-of-turn-detection
4•piyussh•1h ago•0 comments

Trump and Netanyahu Have Stepped in It Now

https://www.nytimes.com/2026/06/18/opinion/israel-america-iran-trump-vance.html
6•duxup•1h ago•5 comments

Typewriter Tinnitus/Morse Code Tinnitus

https://hearinglosshelp.com/blog/typewriter-tinnitus-morse-code-tinnitus/
2•austinallegro•1h ago•0 comments

Show HN: FERNme – agent memory that updates with ~zero LLM calls

https://github.com/mirkofr/FERNme
3•mirkofr•1h ago•0 comments

Giant Banana Pulled Over: Driver Says Cops Have Stopped Him 100s of Times

https://cowboystatedaily.com/2026/06/18/giant-banana-pulled-over-in-montana-driver-says-cops-have...
5•speckx•1h ago•1 comments

Show HN: HN Game Stories – mini-documentary of games that hit the front page

https://video.intellios.ai
2•coolwulf•1h ago•0 comments

Show HN: Submarius – Global water clarity for divers

https://submarius.com
8•celloer•1h ago•2 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