Our partner

Thoughts from transgressing dimension
Here you can see some of my wild thoughts and you may find some good worldly ideas on here. I just love thinking and thought I should let my thinking be read.
User avatar
highdimensionman
Consumer 2
Consumer 2
 
Posts: 55
Joined: Tue Jul 08, 2014 5:38 pm
Blog: View Blog (1012)
Archives
- November 2022
+ September 2022
+ August 2022
+ July 2022
+ June 2022
+ May 2022
+ April 2022
+ March 2022
+ February 2022
+ January 2022
+ December 2021
+ November 2021
+ October 2021
+ September 2021
+ August 2021
+ July 2021
+ June 2021
+ May 2021
+ April 2021
+ January 2021
+ December 2020
+ November 2020
+ October 2020
+ September 2020
+ August 2020
+ July 2020
+ June 2020
+ May 2020
+ April 2020
+ February 2020
+ November 2019
+ October 2019
+ September 2019
+ May 2018
+ April 2018
+ March 2018
+ February 2018
+ December 2017
+ August 2017
+ May 2017
+ April 2017
+ March 2017
+ February 2017
+ December 2016
+ November 2016
+ October 2016
+ September 2015
+ August 2015
+ April 2015
+ March 2015
+ February 2015
+ January 2015
+ December 2014
+ November 2014
+ September 2014
+ August 2014
Search Blogs

The immortal sales man solution to p vs np

Permanent Linkby highdimensionman on Wed Dec 10, 2014 12:54 pm

Does p equal np for some np problems yes well sort of and the proof is simple
lets say your traveling sales man lives on a straight street with 3 houses 200m apart he lives in the first house and needs to go to the second and third house to sale his chairs. his optimal route is salenumber*200m due north. in an unoptimal np approach to this problem he looks up the street checks the distance from the nearest house to the furthest house tests if going to the second house first cuts time tests if walking round the block leading away from the first house back round to the second house cuts time and realises it doesn't matter on this occasion whether he starts at the first or last house as long as he walks in a straight line to the end and back because hes walking back home after anyway and decides to start at the second house so he can get that out the way and have a bit of time trying to sell more chairs to the person in the closest house. He ends up spending too much time trying to convince house number 3s occupant to buy just one chair without any luck such that number 2 has already gone out for lunch with a friend.

How did I come to the p conclusion through mental np type analysis and here in lyes the problem and the solution.
lets say now my traveling sales man is immortal and sales to ten different houses in a town of 4500 houses every day.
he sells to ten different houses than the day before and he uses various differernt ways of calculating with different multiples of numbers representing 1 to 10000 to work out his journey every day each day homming in on a more optimal p type solution that works for all the routes he could take eventually considering the map never changes he finds eventually the optimal p type solution for all optimal routes given any possible 10 sales but realises some thing very significant. simply finding the p type solution was an np problem.
Is it possible to use a p type solution instead by which to find an np solution of course it is you could map every possiblity in a type of p form that ultimatly gives you the optimal travelling sales man solution for every 10 different sales would this be quicker than using an np solution every day it can be yes depending on how many days he does this but you need to work in np to work it out quick enough. what im talking about is a relatavistic paradox.

Whats the purpose of stating this paradox well because the p to np problem is a relatavistic paradox theres infinitley many ways to prove this.
The simplist proof being it required you np time in the first place to work out how to count from 1 to what ever in integers more np time to realise fractions and decimal places yet more np time to make good use of 0 and you've barely scratched the surface so does p = np yes it does because theres all possible solutions in p time but also no because you need np time to discover the right possibilities. so at the point of an able p working up too infinity to the power of infinity of complexity such a polynomial equation can solve all np problems from here to infinity but you need infinite np time just to understand the p logic required for such an polynomial time function.

why is this of any relavence actually its of major relevence.
this means as intelligence evolves it achieves ever closer to optimal solutions for all encountered complex problems.

In other words the pursute is required by which to find the solution but there is always a p time solution with the exception of problems involving infinite degres of complexity unless you are working with infinite complexity as you method of counting with p time. in other words the p to np problem is a paradox that converges at the point of infinite complexity.

Diagnosis - Paranoid Schizophrenia although challenged.
Medication - Clopixol injection 4 weekly.
Personal diagnosis - I battle with the chemistry and biological effects of Clopixol every day trying to improve on the heath and range of my approach.
I try to improve my thinking. Hopefully some good ideas shine through.
0 Comments Viewed 7177 times

Who is online

Registered users: Bing [Bot], Google [Bot], Google Adsense [Bot], Google Feedfetcher, lilyfairy