All Topics
All Topics
Technology
Technology
Design
Design
Programming
Programming
Science
Science
News
News
Gaming
Gaming
Entertainment
Entertainment
Business
Business
Finance
Finance
Sports
Sports
Health
Health
Food
Food
Travel
Travel
Art
Art
Music
Music
Books
Books
Education
Education
Politics
Politics
Personal
Personal
No algorithm. No AI slop. No ads. Just RSS. Pro-human. Indie writers. Real journalism. Open web. Chronological. Hand toasted.

GitHub Repository Claims Solution to Navier-Stokes Millennium Prize Problem Using Limit Functional Theorem and LLM Collaboration

By

porton

5mo ago· 1 min readenCode

Summary

A GitHub repository claims to present a solution to the Navier-Stokes Clay Math Millennium Prize Problem using a theorem about extending limit functionals linearly to entire function spaces. The author states they proved the theorem without AI, then collaborated with ChatGPT to apply it to the Navier-Stokes problem, with the LLM claiming to have successfully solved it. The author rewrote and checked the proof for errors.

Key quotes

· 4 pulled
A solution of Navier-Stokes Clay Math Millennium Prize Problem using my theorem that lim (limit) functional can be linearly extended to the entire space of functions, in collaboration with LLM.
Before I proved the above very powerful theorem (without use of AI). Then I tried to ask ChatGPT to prove Navier-Stokes Clay Math Problem using this theorem.
ChatGPT claimed to have successfully done it.
I rewrote and checked for error
Snippet from the RSS feed
A solution of Navier-Stokes Clay Math Millennium Prize Problem using my theorem that lim (limit) functional can be linearly extended to the entire space of functions, in collaboration with an LLM. ...

You might also wanna read

Deriving the Sparse Cholesky Elimination Tree for Matrix Factorization

This article provides a technical derivation of the elimination tree for the right-looking sparse Cholesky algorithm (A = LL^T) for sparse m

reidatcheson.com·21d ago

Research Paper: Turing Completeness of GNU find Command - Three Computational Power Results

This academic paper demonstrates that the GNU find command, a standard Unix utility, possesses unexpected computational power and is Turing

arxiv.org·3mo ago

Research Shows All 23-Bit Still Life Patterns in Conway's Game of Life Are Glider Constructible

The article discusses research in Conway's Game of Life about which still life patterns can be constructed by colliding gliders. It explains

mvr.github.io·4mo ago

Korean Mathematician Solves 60-Year-Old Geometry Puzzle: The Moving Sofa Problem

Korean mathematician Baek Jin-eon has solved the 'moving sofa problem,' a geometry puzzle that had remained unsolved for nearly 60 years. Hi

koreaherald.com·4mo ago

Mathematicians Claim Breakthrough in Algebraic Geometry Using String Theory-Inspired Techniques

A team of mathematicians has claimed to solve a major problem in algebraic geometry using unconventional techniques inspired by string theor

quantamagazine.org·5mo ago

Manuscript Presents Spectral-Geometric Proof of Riemann Hypothesis Claiming Complete Mathematical Framework

This manuscript presents a complete spectral-geometric proof of the Riemann Hypothesis, claiming to unify analytic, operator-theoretic, and

zenodo.org·6mo ago