frontpage.
newsnewestaskshowjobs

Open Source @Github

fp.

Unauthenticated remote code execution in Nginx

https://www.wiz.io/blog/nginx-http2-rce-vulnerabilities
1053•speedping•8h ago•482 comments

Seven new models at scalable price-performance

https://microsoft.ai/news/microsoft-ignite-2026/
410•gmays•7h ago•284 comments

Inside Deutsche Bank

https://www.inside-db.com/
520•gyre007•8h ago•182 comments

DaisyRose-27B: 1,200-task RL took Qwen3.8 from 5.6% to 12% on Terminal-Bench 4.1

https://www.radixark.com/blog/daisyrose-27b
111•de_sty•4h ago•30 comments

AI agents ask better questions than KPMG accountants in audit trial

https://europeanbusinessmagazine.com/ai-agents-better-questions-kpmg/
315•Betelbuddy•8h ago•144 comments

DNS resolvers are the wrong place to fight piracy

https://techstackups.com/articles/quad9-leaves-france-dns-blocking/
566•ritzaco•10h ago•212 comments

Gemini 4 Neon

https://blog.google/innovation-and-ai/models-and-research/gemini-models/introducing-gemini-4-neon/
331•yigitdemirag•2h ago•317 comments

Cuttlefish on Mac: Android's Virtual Device Framework on Apple Silicon

https://engineering.fb.com/2026/11/13/android/cuttlefish-on-mac/
29•acossta•3d ago•5 comments

Advancing chip design with OpenAI models

https://openai.com/index/advancing-chip-design-with-our-models/
147•vighneshiyer•6h ago•84 comments

LLM Assisted Reverse Engineering

https://www.slowchronicle.com/posts/llm-assisted-reverse-engineering
13•ioma8•1h ago•0 comments

A Collage Showing 49 Drill Holes Made by NASA's Curiosity Mars Rover

https://science.nasa.gov/photojournal/a-collage-showing-49-drill-holes-made-by-nasas-curiosity-ma...
17•wawayanda•2d ago•2 comments

The Cambridge Dictionary has named ‘human’ as the Word of the Year 2026

https://www.cam.ac.uk/news/cambridge-dictionary-reveals-word-of-the-year-2026
227•DeepLogin•9h ago•166 comments

Show HN: ExitPath – Open-source ways out of Slack, Notion and Microsoft 365

https://exitpath-ruddy.vercel.app/
142•zerocool0101•7h ago•41 comments

Show HN: Take Voyager 1 apart, down to a single memory chip

https://rshekhar.com/voyager/
138•raj-shekhar•7h ago•30 comments

Genie 4 is now available

https://blog.google/innovation-and-ai/models-and-research/google-deepmind/genie-4-now-available-p...
169•leumon•5h ago•139 comments

CrossPoint Reader

https://crosspointreader.com
91•kristianpaul•6h ago•47 comments

The First Revolver: How We Got from Blackbeard's Six Pistols to the Six-Shooter

https://americanhandgunner.com/handguns/revolvers/the-first-revolver/
52•bushwart•3d ago•35 comments

KVM: x86: Unconditionally reset MMU context when emulating INIT (CVE-2026-99312)

https://www.cve.org/CVERecord?id=CVE-2026-99312
164•Kozmik1•7h ago•113 comments

Show HN: Mastra Factory, the open-source software factory we use to build Mastra

78•codekarate•7h ago•27 comments

The x86 CPU: From 4004 to 486

https://pikuma.com/blog/history-of-x86-4004-to-486
132•ibobev•9h ago•45 comments

The Magic of Partial Evaluation

https://jimmyhmiller.com/magic-of-partial-evaluation
85•aray07•5h ago•22 comments

Search Browser – Minimalist WebKit browser with Chrome extension support

https://searchbrowser.app/
48•rsaz•3h ago•32 comments

GTA6-like as a 942Kb UEFI bootable image

https://github.com/eklavya-raj/gta6-uefi
17•bananaboy•1h ago•17 comments

Energy-Based Reasoners: 385x more efficient inference

https://energy-based-reasoners.github.io/
297•frenchmajesty•14h ago•51 comments

Why educational system is broken

https://keycybermonk.com/edu
11•makosst•1h ago•9 comments

A Primer on Fourier Series (2025)

https://arxiv.org/abs/2510.18203
104•teleforce•9h ago•28 comments

Sexp Matrix

https://lisper.cc/ideas/entangle.html
28•todsacerdoti•3h ago•10 comments

Horizon Labs Report

https://horizon-labs.ai/
19•gmays•3h ago•5 comments

Evidence (YC S21) Is Hiring

https://www.ycombinator.com/companies/evidence/jobs/1xb9PpP-founding-gtm-lead
1•amcaskill•11h ago

F-22 Next-Generation micro–Data Transfer Cartridge (mDTC)

https://sam.gov/workspace/contract/opp/8948e8601e964c6aba9c801eee16b1be/view
139•birdboat00•8h ago•104 comments
Open in hackernews

Flat origami is Turing complete (2023)

https://arxiv.org/abs/2309.07932
40•PaulHoule•1y ago

Comments

gnabgib•1y ago
Related How to Build an Origami Computer (63 points, 2024, 15 comments) https://news.ycombinator.com/item?id=39191627
NooneAtAll3•1y ago
> we prove that flat origami, when viewed as a computational device, is Turing complete, or more specifically P-complete

...aren't those mutually exclusive?

I feel a mix of "those are obviously different complexity levels" and "is it like C pre-processor turing-completeness situation?"

lambdaone•1y ago
My understanding of this is that P-completeness for a problem implies that any problem in P can be transformed into it with a polynomial-time reduction. Deterministic Turing machines (more precisely, the problem of determining the future state of a deterministic Turing machine) are in P.
tromp•1y ago
Not with a polynomial-time reduction though. Quoting from [1]:

> Generically, reductions stronger than polynomial-time reductions are used, since all languages in P (except the empty language and the language of all strings) are P-complete under polynomial-time reductions.

[1] https://en.wikipedia.org/wiki/P-complete

cartoffal•1y ago
Turing completeness and P completeness are completely different things. There is no sense in which P-completeness is a "more specific" version of Turing-completeness.
gitroom•1y ago
Honestly wild how you can get Turing completeness outta folding paper, never thought I'd read that today.
StopDisinfo910•1y ago
That's why I have always prefered Church approach to computation to Turing machines.

The lambda calculus, by its simplicity as just a rewriting language, makes it "obvious" how effective computability emerges from very little.

yorwba•1y ago
The reduction in the article boils down to origami crease patterns simulating rule 110 simulating a cyclic tag system simulating a clockwise Turing machine simulating an arbitrary Turing machine (and specific Turing machines simulating the lambda calculus are known).

Do you think there is an "obvious" way to simulate the lambda calculus using origami crease patterns more directly? For example, a cyclic tag system or even rule 110 configuration simulating the lambda calculus without indirection through Turing machines.

entaloneralie•1y ago
If I may chip in, I wouldn't call it obvious or straight-forward, but multiset rewriting[1] can be implemented in terms of multiplication alone(like in Fractran), and multiplication can be implemented in origami[2], so there might be something there.

[1] https://wiki.xxiivv.com/site/pocket_rewriting

[2] https://wiki.xxiivv.com/site/paper_product.html

PaulHoule
entaloneralie•1y ago
Related: Origami-Constructible Numbers[1] & Folding Primes[2]

[1] https://www.cs.mcgill.ca/~jking/papers/origami.pdf

[2] https://www.pythabacus.com/Origami%20Fractions/folding.htm

•
1y ago
It's a big controversy in CS education, isn't it?

Knuth's Art of Computer Programming was built around assembly language for a fantasy computer which is inspired more or less by the Turing machine (program counter is an index into a program 'state', instructions transform a data 'state' and transition to a different program 'state') whereas Structure and Interpretation of Computer Programs is more inspired by Church.

The pinnacle of undergraduate CS education, I think, is compilers, which is where those approaches are ultimately unified on a practical level (you make a machine that transforms one to the other) but the introductory course for the non-professional programmer or the person who aspires to writing compilers someday is still pretty controversial.

StopDisinfo910•1y ago
> It's a big controversy in CS education, isn't it?

Is it?

I think most people who have heard of the topic are familiar with the Church-Turing thesis and know that both definitions of effective calculability are equivalent.

My preference is mostly a matter of taste I think. I admire how little there is to the lambda calculus definition and how computability somehow emerges through construction and definition (which admittedly are not simple). It nicely shows that you need very little "machinery" to get a powerful computational system.

Turing machines by comparaison seem somewhat contrieved with their infinite tape, head and register even if I realise that in a lot of way they are closer to an actual computer.