# Computational Complexity and P vs. NP, A New Insight [closed]

There is a preprint on arXiv that states (in my own words).

If there are three numbers (digits) and task is to add all three numbers. First we well take two number to add, set aside third number. Then we will add third number in previous sum of two numbers. So, addition of three number requires two steps, because we cannot interact and manipulate more than two numbers in single instant. Our limitation to interact with only two number in single step has played very important role. This is one of reasons why Math axioms involve only two number e.g a.0=0, b.1=b etc…Similarly we cannot sort more than two numbers in single step. If there is a system that can sort three objects in single step it will be 200% more time efficient. The kind of sorting that involves three numbers in single step is not possible by humans or man-made machines (not even Turing machines ). But one such system is explained in the paper along with consequences.

The paper concludes

“It can be stated explicitly that computational complexity appears because of Mathematical Axioms that are constrained by and based on human cognitive limits as human cannot interact with more than two numbers at an instant”

Is above statement right?

## closed as off-topic by David Richerby, Evil, fade2black, Yuval Filmus, JuhoDec 17 '17 at 11:24

This question appears to be off-topic. The users who voted to close gave this specific reason:

• "This question does not appear to be about computer science, within the scope defined in the help center." – David Richerby, Evil, fade2black, Yuval Filmus, Juho
If this question can be reworded to fit the rules in the help center, please edit the question.

• "Are the claims of this paper correct?" isn't really within the scope of the site. Without carefully reading the paper, it's not really possible to say whether it's correct or not and, although the paper's fairly short, that's still more work than is generally appropriate for a Stack Exchange answer. – David Richerby Dec 15 '17 at 15:09
• I wouldn't take this "paper" seriously at all. – Omar Dec 15 '17 at 15:10
• @Omar you may, I don't want either, but questions raised in this paper are hard to ignore. – user81905 Dec 15 '17 at 15:47
• I don't think so. The author does not even seem aware of the extended Church-Turing thesis, let alone that a "third-order comparator" or a "200%" improvement are particularly trivial suggestions/observations. – Omar Dec 15 '17 at 15:56
• Sure. Such gates are possible with any constant number of inputs (not just three), and may result in any constant factor speedup. In complexity theory, that's not a big deal. It is very well understood. – Omar Dec 15 '17 at 16:08