<?xml version="1.0" encoding="UTF-8"?><rss xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:atom="http://www.w3.org/2005/Atom" version="2.0"><channel><title><![CDATA[RSS Feed]]></title><description><![CDATA[RSS Feed]]></description><link>http://direct.ecency.com</link><image><url>http://direct.ecency.com/logo512.png</url><title>RSS Feed</title><link>http://direct.ecency.com</link></image><generator>RSS for Node</generator><lastBuildDate>Sat, 11 Apr 2026 16:45:31 GMT</lastBuildDate><atom:link href="http://direct.ecency.com/created/decidability/rss.xml" rel="self" type="application/rss+xml"/><item><title><![CDATA[Lower bounds on time complexity]]></title><description><![CDATA[I'm (slowly) continuing to read The Computational Complexity of Logical Theories, and it came in useful answering this Quora question: Can we predict [time] complexity before writing an algorithm? Here's]]></description><link>http://direct.ecency.com/steemstem/@markgritter/lower-bounds-on-time-complexity</link><guid isPermaLink="true">http://direct.ecency.com/steemstem/@markgritter/lower-bounds-on-time-complexity</guid><category><![CDATA[steemstem]]></category><dc:creator><![CDATA[markgritter]]></dc:creator><pubDate>Fri, 07 Sep 2018 00:45:09 GMT</pubDate><enclosure url="https://images.ecency.com/p/7258xSVeJbKkzXhyseBP4PYz11eBDT8sW2oR1a4vfVFS6HYJmM28jqiPGfxcyi3ZcBwg6CXJXqcdUp8exQc1GfK2gKppqCczdK36316ykjepdUNBGJhD7pniEQtohafhN9ZC2HuPDWgDk?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[The Computational Complexity of Some Logical Theories]]></title><description><![CDATA[I'm reading a book from 1979 by Jeanne Ferrante and Charles W. Rackoff: "The Computational Complexity of Logical Theories." Though it's now nearly 40 years old, it still gets cited often, so]]></description><link>http://direct.ecency.com/steemstem/@markgritter/the-computational-complexity-of-some-logical-theories</link><guid isPermaLink="true">http://direct.ecency.com/steemstem/@markgritter/the-computational-complexity-of-some-logical-theories</guid><category><![CDATA[steemstem]]></category><dc:creator><![CDATA[markgritter]]></dc:creator><pubDate>Mon, 20 Aug 2018 20:48:51 GMT</pubDate></item></channel></rss>