News for hackers. Stuff that matters.

A comment on What Computers Cannot Do: The Consequences of Turing-Completeness. Parent comment

Re:What Computers Cannot Do: The Consequences of Turing-Comp... by naasking on Wednesday March 27, 2024 @09:19AM (#39838656)
> Proofs are not reuable: proving something about one program does not tell us anything about other programs.

They are reusable to some degree when the proofs are made with type systems, via Curry-Howard.

[ Parent | on HN ]

There are no comments on this comment yet.