Approach to solve P versus NP with Circular Founded Set

Details Approach to solve P versus NP with Circular Founded Set Approach to solve P versus NP with Circular Founded Set

2011-12-05

arxiv.org/abs/1112.0987v2

Computer Science

Computational Complexity

5 pages, English and Japanese (see Other formats - Source)

Scientific paper

This paper talk about that NP is not AL=P by using circular founded set. I
make set structure of CHAOS and computation history of Turing Machine. CHAOS is
circular founded set and computation history of Turing Machine is well founded
set. And Log space ATM can not compute CHAOS.

Affiliated with

Also associated with

No associations

Rating

Approach to solve P versus NP with Circular Founded Set 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 Approach to solve P versus NP with Circular Founded Set, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Approach to solve P versus NP with Circular Founded Set will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-396037