Tuesday, November 18, 2014
Monday, November 17, 2014
The columns of the matrix are the integers in binary form, but you can generate this matrix recursively in O(n), the real complexity it’s the matrix multiplication.
Friday, November 14, 2014
Friday, November 7, 2014
Added an UNT <"algorithm"> that solves the NP-Complete Subset Sum Problem on a single step.
Universal Number Theory Algorithm for the NP-Complete Sum Subset Problem on Classical Turing Machine
Wednesday, October 29, 2014
Hi all, I want to present my work, it's hard to explain, but here I attached an example of a typical CUDA, but my "Universal Number Theory", the theory itself is quite extensive even the am writing, but more importantly, solves the problem of P vs NP, I invite you to review my work, thanks.