porton
ChatGPT claims to have solved Navier-Stokes problem
Re:Ask HN: Show me your half baked project
on Friday October 13, 2023 @07:09AM (#37869264)
https://github.com/vporton/xml-boiler and https://github.com/vporton/xml-boiler-dlang
It was written a specification (draft but already "functional") for automatic transformation and validation of complex (possibly multi-namespace) XML documents based on namespaces, written a software (XML Boiler) to implement these transformations. Written a short tutorial for XML Boiler.
This is HTML and LaTeX "killer".
Most of the specification was implemented in Python programming language. This project prototype "XML Boiler" is already nearly complete and is practically useful.
Check my P=NP proof for errors
Re:Check my P=NP proof for errors
on Friday August 18, 2023 @10:19AM (#37175982)
The proof is based on inverting bijections, passing algorithms as arguments to algorithms, incompleteness of ZFC, reducing SAT to another NP problem.
Twitter+LiveJournal+Kindle+Dmoz and Affiliate Program
We (two founders) are creating startup that will provide a site with functionality like Twitter+LiveJournal+Kindle+Dmoz and an advanced affiliate program (so, we pay authors). It will run on revolutionary Internet Computer blockchain.The site will be based on an advanced system of folders: there will be both owner and communal folders to represent authorship or community.We aim at never...
Re:Check my proof of P=NP for errors [pdf]
on Tuesday June 29, 2021 @05:18AM (#27673587)
The number of bits is s(X) not X. So, the rest in your response is in error.
Why do you think my proofs needs to pre-calculate all possible input-output mappings? I use only verification that a particular input corresponds to a particular output (and I prove that this verification is polynomial-time.)
"That isn't what P =? NP is looking for. The forward function, A, isn't a big look-up table. Instead, it's a much smaller set of transformational steps." - no idea what you mean.
No comment on obvious (and true) things you said after this.
Re:Check my proof of P=NP for errors [pdf]
on Tuesday June 29, 2021 @01:06AM (#27672007)
Re:Check my proof of P=NP for errors [pdf]
on Tuesday June 29, 2021 @01:05AM (#27672004)
More detailed proof of P=NP with errors corrected:
https://math.portonvictor.org/wp-content/uploads/2021/06/pnp...
Re:Check my proof of P=NP for errors [pdf]
on Tuesday June 29, 2021 @01:04AM (#27671999)
You understood mostly right, but see my another comment for more detailed proof that does address this issue by ignoring zero-filled fragments of INFINITE memory.
There is no "n".
Re:Check my proof of P=NP for errors [pdf]
on Monday June 28, 2021 @10:32AM (#27662492)
Because for my proof to work I need polynomial-time hashing.
Re:Check my proof of P=NP for errors [pdf]
on Monday June 28, 2021 @10:19AM (#27662310)
I am not an employee or partner of Cartesi (however, in the future I am going to be), I even tried to be hired but wasn't. I do like Cartesi to be advertised because I like that OSS project, but not so much to spend my time in marketing them. So, no, I don't advertise them by my P=NP question.
Re:Check my proof of P=NP for errors [pdf]
on Monday June 28, 2021 @09:53AM (#27661987)
I prove that an NP-complete cryptocurrency is polynomial time. Comment if you did or did not found an error. No efficient algorithm found.