u/Educational-Math-410

P = NP attempt with Algorithm

I am sharing a proposed algorithmic framework that I believe may be relevant to the P vs NP problem.

I am not asking anyone to accept the claim without verification. I am asking for serious technical scrutiny: please test the construction, look for failure points, check whether the reduction is faithful, and identify where the argument breaks if it does. and ı didnt finish the full structure please read the abstract first.

If the algorithmic structure is found to be valid or even partially meaningful, I would appreciate help in getting it reviewed by people with the right background as quickly and responsibly as possible.

My main request is simple: please do not dismiss it by title alone. Take the algorithm, test it, attack it, and you can finish the whole structure if ı am right.

you can find the link here: https://zenodo.org/records/20192373

reddit.com
u/Educational-Math-410 — 7 days ago
▲ 0 r/Collatz+1 crossposts

Unfinished P = NP attempt with Algorithm ı would suggest checking the core

I am sharing a proposed algorithmic framework that I believe may be relevant to the P vs NP problem.

I am not asking anyone to accept the claim without verification. I am asking for serious technical scrutiny: please test the construction, look for failure points, check whether the reduction is faithful, and identify where the argument breaks if it does. and ı didnt finish the full structure please read the abstract first.

If the algorithmic structure is found to be valid or even partially meaningful, I would appreciate help in getting it reviewed by people with the right background as quickly and responsibly as possible.

My main request is simple: please do not dismiss it by title alone. Take the algorithm, test it, attack it, and you can finish the whole structure if ı am right.

you can find the link here: https://zenodo.org/records/20192373

reddit.com
u/Educational-Math-410 — 7 days ago

P vs NP proof attempt: finite-state compression, certificates, and where the argument may break

I am sharing a proposed algorithmic framework that I believe may be relevant to the P vs NP problem.

I am not asking anyone to accept the claim without verification. I am asking for serious technical scrutiny: please test the construction, look for failure points, check whether the reduction is faithful, and identify where the argument breaks if it does. and ı didnt finish the full structure please read the abstract first.

If the algorithmic structure is found to be valid or even partially meaningful, I would appreciate help in getting it reviewed by people with the right background as quickly and responsibly as possible.

My main request is simple: please do not dismiss it by title alone. Take the algorithm, test it, attack it, and tell me exactly where it fails or whether there is something real here.

reddit.com
u/Educational-Math-410 — 7 days ago