https://github.com/lumakernel/ts-never-proves
The type that proves Goldbach's conjecture.
https://github.com/lumakernel/ts-never-proves
Last synced: 14 days ago
JSON representation
The type that proves Goldbach's conjecture.
- Host: GitHub
- URL: https://github.com/lumakernel/ts-never-proves
- Owner: LumaKernel
- Created: 2020-07-07T14:27:50.000Z (almost 5 years ago)
- Default Branch: master
- Last Pushed: 2023-01-07T19:52:46.000Z (over 2 years ago)
- Last Synced: 2025-06-12T03:03:39.389Z (15 days ago)
- Language: TypeScript
- Size: 260 KB
- Stars: 4
- Watchers: 1
- Forks: 1
- Open Issues: 7
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# ts-never-proves
That type `Goldbach` ( in [src/goldbach.d.ts](src/goldbach.d.ts) ) is found to be `False` means [Goldbach's conjecture](https://en.wikipedia.org/wiki/Goldbach%27s_conjecture) is disproved and vice verce.
It's using decisding infinite loop.
This implements [Peano arithmetic](https://en.wikipedia.org/wiki/Peano_axioms) on TypeScript typing system.
Generally, it is [proved to impossible](https://en.wikipedia.org/wiki/Halting_problem)!
That is TypeScript typing system also can't.
Type `GoldbachProvedByNever` is calculated as `never`.
Hm, `never` proves ? No, never proves.
( This is because type `Goldbach` includes `any`. )
### See also
- https://github.com/microsoft/TypeScript/issues/14833