Tim Gowers Proposed and launched a new polymath proposal aimed at a certain approach he has for proving that .

## November 4, 2013

## 4 Comments »

RSS feed for comments on this post. TrackBack URI

RSS feed for comments on this post. TrackBack URI

## Recent Comments

## Polymath Wiki – most recent changes

- Probabilistic formulation of Hadwiger-Nelson problem May 21, 2018 Nazgand
- Hadwiger-Nelson problem May 19, 2018 Pgibbs
- Hadwiger-Nelson problem May 18, 2018 Teorth
- Probabilistic formulation of Hadwiger-Nelson problem May 18, 2018 Teorth
- Hadwiger-Nelson problem May 17, 2018 Teorth
- Hadwiger-Nelson problem May 17, 2018 Nazgand
- Hadwiger-Nelson problem May 16, 2018 Pgibbs
- Hadwiger-Nelson problem May 16, 2018 Aubrey
- Hadwiger-Nelson problem May 15, 2018 Pgibbs
- Hadwiger-Nelson problem May 15, 2018 Aubrey

## Blogroll

## Projects

## Proposals

## Pages

## Categories

- discussion (6)
- finding primes (8)
- hot spots (7)
- Improving Roth bounds (1)
- mock-up (2)
- news (9)
- planning (7)
- polymath proposals (30)
- polymath5 (1)
- research (13)

## Top Posts

- Polymath proposal: finding simpler unit distance graphs of chromatic number 5
- A new polymath proposal (related to the Riemann Hypothesis) over Tao's blog
- Polymath Proposals on Math Overflow
- Spontaneous Polymath 14 - A success!
- About
- Polymath8 - A Success !
- Minipolymath2 project: IMO 2010 Q5
- Polymath proposal: explaining identities for irreducible polynomials
- Rota's Basis Conjecture: Polymath 12?
- Minipolymath4 project: IMO 2012 Q3

%d bloggers like this:

In my opinion the problem P versus NP is not well posed. It is not possible to disregard the nature of the problem: the answer depends whether it has to do only with numeric attributes, as in the case of a bill, or instead it has to do with concepts indicated by substantives, which makes it more difficult to solve and the calculations much harder.

Guido Fiorentino

Comment by Guido fiorentino — November 20, 2013 @ 7:53 am |

I would like to clarify what I intended in my preceding remark. It is usual to set the problem of Time complexity starting from examples of systems where the problem arises: in my opinion it would be instead more reasonable to start from the basic data of the problem: the purpose of the processing, distinguishing in the first place between concepts an attributes. Therefore the normal arithmetic problems, in which the concepts have no part, and T(N) = O(nk), with k = 1, from the others, where the concepts have instead a fundamental role, and it makes a sense to speak of P and NP, as their difference depends from the different purpose of the concepts involved: the task of the P problems is to detect in systems particular properties indicated by corresponding concepts, while that of the NP problems is instead to find specific systems apt to satisfy them.

Guido Fiorentino

Comment by Guido fiorentino — December 9, 2013 @ 3:37 pm |

The P/NP problem is related to the Peano’s Axioms system.

Or I say, the P is based on the Peano’s Axioms. But NP not. So P does not equal to NP.

We know that the Peano’s Axioms system is a standard model. When you step into the non-standard model, you will find the truth.

Comment by Bojin Zheng — February 27, 2014 @ 3:30 am |

How can I join in this project? Just ask

Comment by hadimaster65555 — April 10, 2014 @ 5:15 pm |