Computational Complexity on Signed Numbers

Details Computational Complexity on Signed Numbers Computational Complexity on Signed Numbers

2011-04-13

arxiv.org/abs/1104.2538v1

Computer Science

Computational Complexity

Scientific paper

This paper presents a new representation of natural numbers and discusses its consequences for computability and computational complexity. The paper argues that the introduction of the first Peano axiom in the traditional definition of natural numbers is not essential. It claims that natural numbers remain usable in traditional ways without assuming the existence of at least one natural number. However, the uncertainty about the existence of natural numbers translates into every computation and introduces intrinsic uncertainty that cannot be avoided. The uncertainty in the output of a computation can be reduced, though, at the expense of a longer runtime and thus higher complexity. For the new representation of natural numbers, the paper claims that, with the first Peano axiom, P is equal to NP, and that without the first Peano axiom, P becomes a proper subset of NP.

Affiliated with

Also associated with

No associations

Rating

Computational Complexity on Signed Numbers does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Computational Complexity on Signed Numbers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computational Complexity on Signed Numbers will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-219227