Home #8 Computer How Einstein Theory is related to ... P vs NP Problem? ... by Dr. Giovanni A. Orlando
How Einstein Theory is related to ... P vs NP Problem? ... by Dr. Giovanni A. Orlando PDF Print E-mail
Written by Administrator   
Saturday, 21 December 2019 16:17

***

Greetings in the day of Saturn, Saturn-day ... the day of Old Wisdom ... the day of Mother Mary ... the Sabbath,

          And yesterday we ... push to the Arena ... "Yang-Mills Problem" ... related to Physics and some ideas of Yang to extend Maxwell Electromagnetics and then the success to mix with Gravity ... but it remains a Problem. Is like the Limit of Post-Einstein Drama ...

         Today we move in the Arena ... a problem we quote for a moment ... and is "P vs NP Problem" ... is a Problem related to Computability.

            Some Ego ... let me say ... that begin to use "Electronic Calculators" when I was very young and I discover its usage with no help to find explanation to a book of "Sines and Cosines ... may be used by the Navy" ... the US Navy, I guess.

           Someone gift me that book ... and other Old books like "Know your USA" ... and you know ... I born in South America, not North America ... because for me ... is "One America".

              Now ... How ... Einstein Theory can be related ... to Computing? ... Humm ...

              Important is to consider ... that ... Computer Science is a Science ... like Math and/or Physics ...

              Interested students can consult ... by example ...

             

             Here we can read the definitions of Our concerns ...

             We can ... begin ...

Definition. A search problem is a problem having solutions with the property that the time needed to certify that any solution is correct is bounded by a polynomial in the size of the input. We say that an algorithm solves a search problem if, given any input, it either produces a solution or reports that none exists.

Definition. NP is the set of all search problems.

Definition. P is the set of all search problems that can be solved in polynomial time.

By this day ... Is not clear ... is the number of problems that be reduced ... in any case ... to Polynomial Time

If this is the case ... then P=NP ... like we declare.

Now, has been an Italian book ... not very popular ... but popular in Italian Universities about 1984-86 ... where I got the idea ... and when I first ear about NP vs P problem.

In fact ... is necessary to have some Mind ... to reach the point ... Old expertise ...

But let me guess ...

Computers have Memory Bank ... popular was ... to use "STO" ... and "RCL" ... to store and recall information. (See HP-41C)

Now ... Memory is Space ... and we are the concern here is ... "Time" ... Polynomial Time ... or "Not Polynomial Time" ... like the Re-organization of a School/College Problem ... or Salesman Problem.

  Now ... is evident ... for Physicists will be clear ... that the answer of the Problem ¨NP vs P"is a problem of Space-Time ... inside a Computer ... or Calculator Machine.

  In fact, ... Some will consider that can extend the Memory of the Computer ... or increase the Storage ... to let ... the Algorithm which is a piece of Art ... get conclusion ... in "Polynomial" Time ...

   NP problems by definition ... consider the Time is "infinite" or "beyond calculable" ...

   Consider you write a problem to prove P=NP ... and the program takes 4 Years ... Absurd! ...

   Computer Time is called also "Time Complexity" ... which give credit to our statement ... Space-Time in the Computer.

   Recently ... began to enter in discussion ... "Quantum Computers" ... and times like BQP ...

   ... But we consider ...

The Universe is Harmonic

   therefore ... we consider ... NP = P ... of course to be proven.

Thanks,
Dr. Giovanni A. Orlando.

 

Last Updated on Monday, 06 January 2020 15:54