Computational Complexity and P vs. NP, A New Insight 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?

Preprint Link
https://arxiv.org/abs/1711.10874
No.  The paper appears to be total baloney.   I noticed multiple unjustified statements in my first 60 seconds reading the paper.  Don't waste your time with it.

arxiv is not peer-reviewed.  Some papers on arxiv are great; some papers are arxiv are terrible and a waste of time.  Its presence on arxiv says very little about its quality.  It's like finding a paper on someone's personal website.