<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	
	>
<channel>
	<title>Comments on: Amoeba finds approximate solutions to NP-hard problem in linear time</title>
	<atom:link href="http://www.epanorama.net/blog/2018/12/25/amoeba-finds-approximate-solutions-to-np-hard-problem-in-linear-time/feed/" rel="self" type="application/rss+xml" />
	<link>https://www.epanorama.net/blog/2018/12/25/amoeba-finds-approximate-solutions-to-np-hard-problem-in-linear-time/</link>
	<description>All about electronics and circuit design</description>
	<lastBuildDate>Sun, 05 Apr 2026 13:29:12 +0000</lastBuildDate>
		<sy:updatePeriod>hourly</sy:updatePeriod>
		<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.9.14</generator>
	<item>
		<title>By: anna</title>
		<link>https://www.epanorama.net/blog/2018/12/25/amoeba-finds-approximate-solutions-to-np-hard-problem-in-linear-time/comment-page-1/#comment-1770317</link>
		<dc:creator><![CDATA[anna]]></dc:creator>
		<pubDate>Tue, 31 May 2022 03:20:39 +0000</pubDate>
		<guid isPermaLink="false">http://www.epanorama.net/newepa/?p=181010#comment-1770317</guid>
		<description><![CDATA[Thank you for your post. I have read through some similar topics! However, your post gave me a very special impression, unlike other articles. I hope you continue to have valuable articles like these or more to share with everyone! &lt;a href=&quot;https://crosswordpuzzles.onl&quot; rel=&quot;nofollow&quot;&gt;crossword puzzles&lt;/a&gt;]]></description>
		<content:encoded><![CDATA[<p>Thank you for your post. I have read through some similar topics! However, your post gave me a very special impression, unlike other articles. I hope you continue to have valuable articles like these or more to share with everyone! <a href="https://crosswordpuzzles.onl" rel="nofollow">crossword puzzles</a></p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Tomi Engdahl</title>
		<link>https://www.epanorama.net/blog/2018/12/25/amoeba-finds-approximate-solutions-to-np-hard-problem-in-linear-time/comment-page-1/#comment-1618561</link>
		<dc:creator><![CDATA[Tomi Engdahl]]></dc:creator>
		<pubDate>Wed, 26 Dec 2018 23:04:39 +0000</pubDate>
		<guid isPermaLink="false">http://www.epanorama.net/newepa/?p=181010#comment-1618561</guid>
		<description><![CDATA[A Slimy, Brainless Amoeba Just Found A Completely Unexpected Solution To A College-Level Math Problem
https://www.iflscience.com/plants-and-animals/a-slimy-brainless-amoeba-just-found-a-completely-unexpected-solution-to-a-collegelevel-math-problem/

Unless you’ve studied math to a pretty high level, you probably haven’t heard of the Traveling Salesman Problem. That’s a shame because it’s one of the finest examples available to the question we’ve all asked at some point – “when will I ever need math in the real world?”

planning a journey between, say, four cities. That’s not too hard; there are only three possible routes you can take.

But if we double that number to eight cities, there are over 2,500 possible routes we can take 

It’s an NP-hard problem

A new study published this week in Royal Society Open Science has shown that a plasmodium, or “true slime mold” amoeba, is able to find near-optimal solutions to the Traveling Salesman Problem in linear time – meaning that adding more cities does not result in a huge increase in the amount of time our slimy friend takes to find an answer.]]></description>
		<content:encoded><![CDATA[<p>A Slimy, Brainless Amoeba Just Found A Completely Unexpected Solution To A College-Level Math Problem<br />
<a href="https://www.iflscience.com/plants-and-animals/a-slimy-brainless-amoeba-just-found-a-completely-unexpected-solution-to-a-collegelevel-math-problem/" rel="nofollow">https://www.iflscience.com/plants-and-animals/a-slimy-brainless-amoeba-just-found-a-completely-unexpected-solution-to-a-collegelevel-math-problem/</a></p>
<p>Unless you’ve studied math to a pretty high level, you probably haven’t heard of the Traveling Salesman Problem. That’s a shame because it’s one of the finest examples available to the question we’ve all asked at some point – “when will I ever need math in the real world?”</p>
<p>planning a journey between, say, four cities. That’s not too hard; there are only three possible routes you can take.</p>
<p>But if we double that number to eight cities, there are over 2,500 possible routes we can take </p>
<p>It’s an NP-hard problem</p>
<p>A new study published this week in Royal Society Open Science has shown that a plasmodium, or “true slime mold” amoeba, is able to find near-optimal solutions to the Traveling Salesman Problem in linear time – meaning that adding more cities does not result in a huge increase in the amount of time our slimy friend takes to find an answer.</p>
]]></content:encoded>
	</item>
</channel>
</rss>
