<?xml version="1.0" encoding="UTF-8"?><!-- generator="wordpress/1.5.2" -->
<rss version="2.0" 
	xmlns:content="http://purl.org/rss/1.0/modules/content/">
<channel>
	<title>Comments on: Addiplication</title>
	<link>http://bit-player.org/2007/addiplication</link>
	<description>An amateur's outlook on computation and mathematics.</description>
	<pubDate>Fri, 29 Aug 2008 08:05:35 +0000</pubDate>
	<generator>http://wordpress.org/?v=1.5.2</generator>

	<item>
 		<title>Comment on Addiplication by: Kennedy</title>
		<link>http://bit-player.org/2007/addiplication#comment-1493</link>
		<pubDate>Mon, 03 Sep 2007 17:30:46 +0000</pubDate>
		<guid>http://bit-player.org/2007/addiplication#comment-1493</guid>
					<description>That's HTML entity  ampersand lowast semicolon.</description>
		<content:encoded><![CDATA[	<p>That&#8217;s HTML entity  ampersand lowast semicolon.
</p>
]]></content:encoded>
				</item>
	<item>
 		<title>Comment on Addiplication by: Kennedy</title>
		<link>http://bit-player.org/2007/addiplication#comment-1492</link>
		<pubDate>Mon, 03 Sep 2007 17:29:55 +0000</pubDate>
		<guid>http://bit-player.org/2007/addiplication#comment-1492</guid>
					<description>&amp;#8727; is a pretty close facsimile of Tanimoto's star operator.</description>
		<content:encoded><![CDATA[	<p>&lowast; is a pretty close facsimile of Tanimoto&#8217;s star operator.
</p>
]]></content:encoded>
				</item>
	<item>
 		<title>Comment on Addiplication by: brian</title>
		<link>http://bit-player.org/2007/addiplication#comment-1491</link>
		<pubDate>Mon, 03 Sep 2007 12:44:00 +0000</pubDate>
		<guid>http://bit-player.org/2007/addiplication#comment-1491</guid>
					<description>Uh oh. As far as I can tell, the issues raised by Jonathan Katz and Barry Cipra are problems with my interpretation of Tanimoto's paper, not problems with the paper itself.

To address Barry's point first, it appears that the correct relations are as follows:

if &amp;#8194;&lt;em&gt;a&lt;/em&gt;+&lt;em&gt;b&lt;/em&gt;&amp;#8194; &amp;#8804; &amp;#8194;&lt;em&gt;a&lt;/em&gt;&amp;#215;&lt;em&gt;b&lt;/em&gt;, &amp;#8195;&amp;#8195;&lt;em&gt;a&lt;/em&gt;+&lt;em&gt;b&lt;/em&gt;&amp;#8194; &amp;#8804; &amp;#8194;&lt;em&gt;a&lt;/em&gt; &amp;#9674; &lt;em&gt;b&lt;/em&gt;&amp;#8194; &amp;#8804; &amp;#8194;&lt;em&gt;a&lt;/em&gt;&amp;#215;&lt;em&gt;b&lt;/em&gt;;

if &amp;#8194;&lt;em&gt;a&lt;/em&gt;+&lt;em&gt;b&lt;/em&gt;&amp;#8194; &amp;#8805; &amp;#8194;&lt;em&gt;a&lt;/em&gt;&amp;#215;&lt;em&gt;b&lt;/em&gt;, &amp;#8195;&amp;#8195;&lt;em&gt;a&lt;/em&gt;+&lt;em&gt;b&lt;/em&gt;&amp;#8194; &amp;#8805; &amp;#8194;&lt;em&gt;a&lt;/em&gt; &amp;#9674; &lt;em&gt;b&lt;/em&gt;&amp;#8194; &amp;#8805; &amp;#8194;&lt;em&gt;a&lt;/em&gt;&amp;#215;&lt;em&gt;b&lt;/em&gt;;

As for the much simpler construction by Jonathan Katz: Tanimoto writes &quot;the binary operation can be regarded as an intermediate operation between addition and multiplication&quot; but never claims it is unique in this respect. For that matter, I made no claim of uniqueness either, but I certainly missed the point that constructing such an intermediate operation is not in itself particularly remarkable. Katz's example seems an especially nice one. Of course one could also use the geometric mean of a+b and a&amp;#215;b, or even the AGM of the sum and the product.</description>
		<content:encoded><![CDATA[	<p>Uh oh. As far as I can tell, the issues raised by Jonathan Katz and Barry Cipra are problems with my interpretation of Tanimoto&#8217;s paper, not problems with the paper itself.</p>
	<p>To address Barry&#8217;s point first, it appears that the correct relations are as follows:</p>
	<p>if &ensp;<em>a</em>+<em>b</em>&ensp; &le; &ensp;<em>a</em>&times;<em>b</em>, &emsp;&emsp;<em>a</em>+<em>b</em>&ensp; &le; &ensp;<em>a</em> &loz; <em>b</em>&ensp; &le; &ensp;<em>a</em>&times;<em>b</em>;</p>
	<p>if &ensp;<em>a</em>+<em>b</em>&ensp; &ge; &ensp;<em>a</em>&times;<em>b</em>, &emsp;&emsp;<em>a</em>+<em>b</em>&ensp; &ge; &ensp;<em>a</em> &loz; <em>b</em>&ensp; &ge; &ensp;<em>a</em>&times;<em>b</em>;</p>
	<p>As for the much simpler construction by Jonathan Katz: Tanimoto writes &#8220;the binary operation can be regarded as an intermediate operation between addition and multiplication&#8221; but never claims it is unique in this respect. For that matter, I made no claim of uniqueness either, but I certainly missed the point that constructing such an intermediate operation is not in itself particularly remarkable. Katz&#8217;s example seems an especially nice one. Of course one could also use the geometric mean of a+b and a&times;b, or even the AGM of the sum and the product.
</p>
]]></content:encoded>
				</item>
	<item>
 		<title>Comment on Addiplication by: Barry Cipra</title>
		<link>http://bit-player.org/2007/addiplication#comment-1490</link>
		<pubDate>Sun, 02 Sep 2007 03:43:25 +0000</pubDate>
		<guid>http://bit-player.org/2007/addiplication#comment-1490</guid>
					<description>Another problem:  Tanimoto shows that 1◊x=x for all (positive) x, which violates your stipulation

if  a+b  &amp;#62;  a×b,   a+b  &amp;#62;  a ◊ b  &amp;#62;  a×b

(here a=1, b=x).</description>
		<content:encoded><![CDATA[	<p>Another problem:  Tanimoto shows that 1◊x=x for all (positive) x, which violates your stipulation</p>
	<p>if  a+b  &gt;  a×b,   a+b  &gt;  a ◊ b  &gt;  a×b</p>
	<p>(here a=1, b=x).
</p>
]]></content:encoded>
				</item>
	<item>
 		<title>Comment on Addiplication by: Jonathan Katz</title>
		<link>http://bit-player.org/2007/addiplication#comment-1489</link>
		<pubDate>Sun, 02 Sep 2007 00:48:57 +0000</pubDate>
		<guid>http://bit-player.org/2007/addiplication#comment-1489</guid>
					<description>Maybe I'm missing something, but isn't there a trivial solution? Let me use . instead of your symbol, and AM for arithmetic mean. Then why not define: a.b = AM(a+b, a*b) ?</description>
		<content:encoded><![CDATA[	<p>Maybe I&#8217;m missing something, but isn&#8217;t there a trivial solution? Let me use . instead of your symbol, and AM for arithmetic mean. Then why not define: a.b = AM(a+b, a*b) ?
</p>
]]></content:encoded>
				</item>
</channel>
</rss>
