|
7 | 7 | <name>Bullshit Program</name> |
8 | 8 | <uri>https://bullshitprogram.com/en-us/</uri> |
9 | 9 | </author> |
10 | | - <updated>2025-06-16T05:11:19Z</updated> |
| 10 | + <updated>2025-06-16T05:37:27Z</updated> |
11 | 11 | <link rel="self" type="application/atom+xml" href="https://bullshitprogram.com/en-us/feed.atom" hreflang="en"/> |
12 | 12 | <link rel="alternate" type="text/html" href="https://bullshitprogram.com/en-us/" hreflang="en"/> |
13 | | - <entry> |
14 | | - <title>我已证明P=NP</title> |
15 | | - <author> |
16 | | - <name>Zeusro</name> |
17 | | - <uri>https://github.com/zeusro</uri> |
18 | | - </author> |
19 | | - <id>https://bullshitprogram.com/en-us/p-np/</id> |
20 | | - <updated>2025-06-16T00:00:00Z</updated> |
21 | | - <published>2025-06-15T00:00:00Z</published> |
22 | | - <content type="html"><h2>start</h2> |
23 | | -<pre><code>One is all,all in one. |
24 | | -</code></pre> |
25 | | -<h2>mathematical proof</h2> |
26 | | -<p>xyz is the special case in n universe.</p> |
27 | | -<pre><code>1:t=0 |
28 | | -2:x=x &amp;&amp; y=y &amp;&amp; z=z &amp;&amp; 1=1 |
29 | | -</code></pre> |
30 | | -<p>But we are actually living in the n universe. |
31 | | -In the n universe:</p> |
32 | | -<pre><code>1:t≠0 |
33 | | -2:1=n ⇔ n=1 |
34 | | -3:P=P ⇔ P=NP |
35 | | -</code></pre> |
36 | | -<p>1=n,n=1,P=NP reduces to P=P.So the P=NP problem could be solved. |
37 | | -For example: |
38 | | -1=n : I am one of the humans. |
39 | | -n=1 : &quot;Compress&quot; all the data to 1.</p> |
40 | | -<pre><code class="language-GO">type N struct { |
41 | | - Sky |
42 | | - Ground |
43 | | - YoungAndBeautiful |
44 | | - Others |
45 | | -} |
46 | | -</code></pre> |
47 | | -<h2>Example: Traveling Salesman Problem (TSP)</h2> |
48 | | -<p>Problem: A salesman needs to visit multiple cities, each exactly once, and return to the starting point. Given the distances between each pair of cities, the question is: Is there a path whose total length does not exceed K?</p> |
49 | | -<p>Answer: In fact, the formulation of this problem is flawed. |
50 | | -The actual problem should be framed as finding the fastest path. |
51 | | -Since time is considered as the one-dimensional world, |
52 | | -the problem can be transformed: it doesn't matter which city you start from. |
53 | | -As long as you always go to the next nearest city after arriving at the current one, the problem becomes solvable as a greedy search for the shortest path.</p> |
54 | | -<p><strong>For the TSP problem, the length measurement standard should be time, not distance in the intuitive sense.</strong></p> |
55 | | -<p>In 3-dimensional Euclidean space, the shortest path between two points is a straight line.</p> |
56 | | -<p><strong>In n dimensions, a segment does not necessarily follow a 3D straight line.</strong></p> |
57 | | -<p><strong>In N-dimensional space, the length of a segment is measured based on time, not distance.</strong></p> |
58 | | -<p>An N-dimensional line segment is a special case at t = 0 in 3D space. |
59 | | -Because it lacks the dimension of time, it becomes a 3D line segment - what we intuitively understand as &quot;the shortest distance between two points is a straight line.&quot;</p> |
60 | | -<p>In dimensions higher than three, the criterion for measuring the length of a line segment is time - the segment with the shortest duration is the shortest N-dimensional line segment.</p> |
61 | | -<p>I think I have proved P=NP problem from math. |
62 | | -Other 20%,time will tell.</p> |
63 | | -<h2>end</h2> |
64 | | -<pre><code>宇宙内事乃己分内事，己分内事乃宇宙内事 |
65 | | -</code></pre></content> |
66 | | - </entry> |
67 | 13 | </feed> |
0 commit comments