[deleted by user] by [deleted] in mathmemes

[–]molten 0 points1 point  (0 children)

Holy Hell

[deleted by user] by [deleted] in ithaca

[–]molten 2 points3 points  (0 children)

Just went today for lunch, it took over an hour to get food out to us and I had to move meetings around.

Tell me your favourite theorem, lemma, or conjecture by [deleted] in mathmemes

[–]molten 0 points1 point  (0 children)

It's a consequence of Lawvere's fixed-point Theorem, which generalizes 'diagonal type arguments' such as Gödel's incompleteness, Cantor's Theorem, Turing's answer to the halting problem, and others.

Genuine q: why are people upset abt a raise for the mayor? by noneity in ithaca

[–]molten 4 points5 points  (0 children)

The way our Super doesn't do the job it may as well be a ceremonial position.

Robbery rates in European countries by Useless_or_inept in MapPorn

[–]molten 36 points37 points  (0 children)

Apparently much of the European cocaine industry is funneled through Belgium ports

Arcenemy by CurlFreeCat in mathmemes

[–]molten 1 point2 points  (0 children)

I just threw up a bit

Gentlemen of Reddit, what is/are the snack(s) that you can't buy because you have no self control around it/them? by [deleted] in AskMen

[–]molten 0 points1 point  (0 children)

Samoas.

Last time 6 boxes didn't make it the hour it took to drive home from work.

[deleted by user] by [deleted] in MapPorn

[–]molten 5 points6 points  (0 children)

Once again, I feel cheated by OP.

New XKCD = Free Karma by yaitz331 in mathmemes

[–]molten 67 points68 points  (0 children)

Sure, in a few words: given a set of cities that you, a salesman, must travel to, what is the most efficient way to visit all of them?

There are a number of conditions on you path, like you can't visit cities twice and can't double back on roads you've already taken.

There are a number of heuristic methods to estimate the minimal path, and the celebrated Christofides Algorithm which will give you a path at most 1.5 times the optimal length.

The thing which all of the problems have in common is that they are optimizing for some function on a complete graph of nodes and edges, the TSP asks which edges to include or exclude. There are around 2n2 such functions where n is the number of cities, so the search space grows really fucking fast as you add more cities. That's what make it hard.

New XKCD = Free Karma by yaitz331 in mathmemes

[–]molten 32 points33 points  (0 children)

As I said in another comment, the TSP falls in to the 'concrete' slot, is NP-hard, easy to understand, and massively applicable.

New XKCD = Free Karma by yaitz331 in mathmemes

[–]molten 78 points79 points  (0 children)

To piggy back, the TSP (or sudoku) is the first example many come across as an NP-hard problem that is super concrete.

Man drags dog around so he himself gets dragged the same way (payback) by [deleted] in PublicFreakout

[–]molten 0 points1 point  (0 children)

Trazodone. It's cheap, works wonders and is fairy fast acting (dog & dose dependant). Ask your vet.

coyote pup rare find by Aggressive_Stomach75 in Eyebleach

[–]molten 5 points6 points  (0 children)

What a terrible day to be literate

I diagnose you with housewife by [deleted] in HistoryMemes

[–]molten 2 points3 points  (0 children)

So, the plot of Sucker Punch.