Traveling Salesman: An Overview of the Job

  • Context: MHB 
  • Thread starter Thread starter mathbalarka
  • Start date Start date
Click For Summary
SUMMARY

The forum discussion revolves around the humor found in the Traveling Salesman problem, particularly its connection to complexity theory and dynamic programming. Participants share their experiences with understanding the joke, highlighting that it resonates primarily with those familiar with computational complexity. References to cultural elements, such as Goethe's Faust and pop culture, illustrate the broader implications of theoretical concepts in real-world scenarios. The conversation emphasizes the unpredictability of real-world applications, as exemplified by vulnerabilities in the Java virtual machine.

PREREQUISITES
  • Understanding of dynamic programming concepts
  • Familiarity with computational complexity theory
  • Knowledge of Java virtual machine vulnerabilities
  • Awareness of cultural references in computer science
NEXT STEPS
  • Research the Traveling Salesman problem and its applications in optimization
  • Study dynamic programming techniques in depth
  • Explore real-world vulnerabilities in Java and other programming languages
  • Investigate the implications of complexity theory in software development
USEFUL FOR

This discussion is beneficial for computer science students, software developers, and anyone interested in the intersection of theoretical computer science and practical programming challenges.

mathbalarka
Messages
452
Reaction score
0

Attachments

  • travelling_salesman_problem.png
    travelling_salesman_problem.png
    20.8 KB · Views: 136
Physics news on Phys.org
Re: Travelling Salesman

I think it took me 5 or 6 times to get the joke... (Headbang) :D
 
Re: Travelling Salesman

I just started a bit of dynamic programming this semester so I get the joke but a month ago I would not have gotten it at all.

<3 xkcd.
 
Re: Travelling Salesman

Ha! This joke is written in secret code and is only completely understandable to ones who are complexity theorists! (Devil)
 
Re: Travelling Salesman

Yes, well, as Mephistopheles says in Goethe's Faust,

My worthy friend, gray are all theories,
And green alone Life's golden tree.

(Though it's taken a bit out of context.) People may conceive and develop beautiful theories, like those about complexity or encryption, but there are thousands of circumstances that are impossible to take into account and that can override all efforts put into those theories. For example, ten years ago a paper (PDF) was published about vulnerabilities in the Java virtual machine where memory faults were induced by heat (!) and then exploited in order to execute arbitrary code. You can prove that Java is type-safe until you are blue in the face, and then someone comes along and does something you never imagined.

Here is another example from the movie Under Siege 2 with Steven Seagal (scroll to 24s).

 
Re: Travelling Salesman

:D That was hilarious!

A lot is said about Chuck Norris. But Seagal solves any NP problem in 1 second.
 
Re: Travelling Salesman

mathbalarka said:
Ha! This joke is written in secret code and is only completely understandable to ones who are complexity theorists! (Devil)

Sadly, that's not where my stupidity was lying.I understood the premise. Just wasn't geting that there is no need for route planning on the internet. Hence banging my head against the wall.
 
P != NP

Problem solved.(Muscle)(Muscle)(Muscle)(Toivo)
 
Brute force solution to any computer programming problem:

EMP pulse-no computers, no problem.
 
  • #10
Deveno said:
Brute force solution to any computer programming problem:

EMP pulse-no computers, no problem.

You and I are about the same age...you remember the drills in school where we were herded into the halls to kneel down with a book over our heads in preparation for the impending thermonuclear barrage? Fun times...(Dull)
 
  • #11
Duck and cover FTW.
 

Similar threads

Replies
3
Views
2K
  • · Replies 0 ·
Replies
0
Views
1K
  • · Replies 80 ·
3
Replies
80
Views
4K
  • · Replies 9 ·
Replies
9
Views
3K
Replies
7
Views
2K
  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 8 ·
Replies
8
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 5 ·
Replies
5
Views
2K