Viewing profile — porton

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 a…

The proof is based on inverting bijections, passing algorithms as arguments to algorithms, incompleteness of ZFC, reducing SAT to another NP problem.

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 w…

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 verifi…

Well, https://math.portonvictor.org/wp-content/uploads/2021/06/pnp...

More detailed proof of P=NP with errors corrected: https://math.portonvictor.org/wp-content/uploads/2021/06/pnp...

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".

Because for my proof to work I need polynomial-time hashing.

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 OS…

I prove that an NP-complete cryptocurrency is polynomial time. Comment if you did or did not found an error. No efficient algorithm found.