<?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: Bulletin of the AMS, Vol. 43, No. 2</title>
	<atom:link href="http://www.arsmathematica.net/2006/04/16/bulletin-of-the-ams-vol-43-no-2/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.arsmathematica.net/2006/04/16/bulletin-of-the-ams-vol-43-no-2/</link>
	<description>Dedicated to the mathematical arts.</description>
	<lastBuildDate>Fri, 29 May 2015 09:17:44 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>https://wordpress.org/?v=4.1.41</generator>
	<item>
		<title>By: michael</title>
		<link>http://www.arsmathematica.net/2006/04/16/bulletin-of-the-ams-vol-43-no-2/#comment-547</link>
		<dc:creator><![CDATA[michael]]></dc:creator>
		<pubDate>Mon, 17 Apr 2006 16:58:35 +0000</pubDate>
		<guid isPermaLink="false">http://www.arsmathematica.net/archives/2006/04/16/bulletin-of-the-ams-vol-43-no-2/#comment-547</guid>
		<description><![CDATA[It might simply be that that was the way I learned it, but I always thought that it was pretty natural to start with simplicial, hit singular, and then finish up with cellular, all with an eye towards the idea that they are computing the same thing. It also mirrors the development of the subject.]]></description>
		<content:encoded><![CDATA[<p>It might simply be that that was the way I learned it, but I always thought that it was pretty natural to start with simplicial, hit singular, and then finish up with cellular, all with an eye towards the idea that they are computing the same thing. It also mirrors the development of the subject.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: sigfpe</title>
		<link>http://www.arsmathematica.net/2006/04/16/bulletin-of-the-ams-vol-43-no-2/#comment-546</link>
		<dc:creator><![CDATA[sigfpe]]></dc:creator>
		<pubDate>Mon, 17 Apr 2006 00:38:36 +0000</pubDate>
		<guid isPermaLink="false">http://www.arsmathematica.net/archives/2006/04/16/bulletin-of-the-ams-vol-43-no-2/#comment-546</guid>
		<description><![CDATA[Does the book discuss de Rham cohomology. I was surprised to find that there are now algorithms to compute &lt;a href=&quot;http://www.math.uiuc.edu/Macaulay2/Book/ComputationsBook/chapters/d-modules/chapter-wrapper.pdf&quot; rel=&quot;nofollow&quot;&gt;de Rham cohomology&lt;/a&gt; as well.]]></description>
		<content:encoded><![CDATA[<p>Does the book discuss de Rham cohomology. I was surprised to find that there are now algorithms to compute <a href="http://www.math.uiuc.edu/Macaulay2/Book/ComputationsBook/chapters/d-modules/chapter-wrapper.pdf" rel="nofollow">de Rham cohomology</a> as well.</p>
]]></content:encoded>
	</item>
</channel>
</rss>
