<?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"
	>
<channel>
	<title>Comments on: A double flip</title>
	<atom:link href="http://bit-player.org/2010/a-double-flip/feed" rel="self" type="application/rss+xml" />
	<link>http://bit-player.org/2010/a-double-flip</link>
	<description>An amateur's outlook on computation and mathematics.</description>
	<pubDate>Thu, 17 May 2012 10:06:43 +0000</pubDate>
	<generator>http://wordpress.org/?v=2.6.3</generator>
		<item>
		<title>By: Greg</title>
		<link>http://bit-player.org/2010/a-double-flip#comment-2709</link>
		<dc:creator>Greg</dc:creator>
		<pubDate>Fri, 19 Mar 2010 23:00:21 +0000</pubDate>
		<guid isPermaLink="false">http://bit-player.org/?p=598#comment-2709</guid>
		<description>It shouldn't be possible to find a "golden rule" to handle all possible mattress situations no matter how many mattresses you add: this would require the group of symmetries to be a cyclic group, but the group needs to have the symmetries of any single mattresses as a subgroup. The group of symmetries of the single mattress has three distinct elements of order two, which is impossible in a cyclic group.</description>
		<content:encoded><![CDATA[<p>It shouldn&#8217;t be possible to find a &#8220;golden rule&#8221; to handle all possible mattress situations no matter how many mattresses you add: this would require the group of symmetries to be a cyclic group, but the group needs to have the symmetries of any single mattresses as a subgroup. The group of symmetries of the single mattress has three distinct elements of order two, which is impossible in a cyclic group.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: John Cowan</title>
		<link>http://bit-player.org/2010/a-double-flip#comment-2702</link>
		<dc:creator>John Cowan</dc:creator>
		<pubDate>Thu, 18 Mar 2010 00:33:09 +0000</pubDate>
		<guid isPermaLink="false">http://bit-player.org/?p=598#comment-2702</guid>
		<description>Unless you have taken the law into your own hands and removed the tag, the mattress is marked already.  So if you confine yourself to rolling and yawing, both of which flip the side the tag is on, you can simply identify one side of the bed as the roll side and the other as the yaw side.</description>
		<content:encoded><![CDATA[<p>Unless you have taken the law into your own hands and removed the tag, the mattress is marked already.  So if you confine yourself to rolling and yawing, both of which flip the side the tag is on, you can simply identify one side of the bed as the roll side and the other as the yaw side.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Jon McAuliffe</title>
		<link>http://bit-player.org/2010/a-double-flip#comment-2701</link>
		<dc:creator>Jon McAuliffe</dc:creator>
		<pubDate>Wed, 17 Mar 2010 23:41:54 +0000</pubDate>
		<guid isPermaLink="false">http://bit-player.org/?p=598#comment-2701</guid>
		<description>My solution to this is to toss a coin each time. Heads is a P (flip over the head), tails is an R. I flip mine everytime I change the valance though, (significantly more than once a season).</description>
		<content:encoded><![CDATA[<p>My solution to this is to toss a coin each time. Heads is a P (flip over the head), tails is an R. I flip mine everytime I change the valance though, (significantly more than once a season).</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Nemo</title>
		<link>http://bit-player.org/2010/a-double-flip#comment-2700</link>
		<dc:creator>Nemo</dc:creator>
		<pubDate>Wed, 17 Mar 2010 19:45:36 +0000</pubDate>
		<guid isPermaLink="false">http://bit-player.org/?p=598#comment-2700</guid>
		<description>P.S.  As for the Hilbert Hotel, my rule would be to move the mattress in room N to room N+1 for each N.  If N is odd, roll the mattress; if N is even, flip the mattress. 

Would my rule count as constant mental effort, or infinite mental effort?

Of course, you will need to keep adding new mattresses.  The Hilbert is like that.</description>
		<content:encoded><![CDATA[<p>P.S.  As for the Hilbert Hotel, my rule would be to move the mattress in room N to room N+1 for each N.  If N is odd, roll the mattress; if N is even, flip the mattress. </p>
<p>Would my rule count as constant mental effort, or infinite mental effort?</p>
<p>Of course, you will need to keep adding new mattresses.  The Hilbert is like that.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Nemo</title>
		<link>http://bit-player.org/2010/a-double-flip#comment-2699</link>
		<dc:creator>Nemo</dc:creator>
		<pubDate>Wed, 17 Mar 2010 19:24:50 +0000</pubDate>
		<guid isPermaLink="false">http://bit-player.org/?p=598#comment-2699</guid>
		<description>If you can alternate rolls and flips (say), you can arrange for any single mattress to have all of its orientations visited.

I do not understand Tim Knoll's description, exactly...  But his idea is sound.  If you simply have a "ring" of two or more beds, and you roll each mattress as it enters bed 1 and flip it as it exits bed 1, then obviously each mattress will visit every possible orientation (because its own sequence of rolls and flips will alternate as it keeps passing through bed 1).

However, if you consider the &lt;b&gt;combination&lt;/b&gt; of mattress orientation &lt;b&gt;and&lt;/b&gt; bed number as the "state" of the mattress, then at least half of the total states will never be visited.   In my example, for instance, "mattress A on bed 1" will only be seen in half of the possible orientations.  I do not believe this can be fixed without introducing memory into the protocol (or marking the mattresses). 

This claim is not too hard to prove...  Without memory, any rule involving moving mattresses among multiple beds reduces to a set of disjoint "rings" (cycles), where each bed has a fixed "next bed" and a fixed "next mattress operation" (I, R, P, or Y).  Again, if you focus on a single mattress and a single bed, you can easily show it can only reach half of the possible orientations &lt;i&gt;on that bed&lt;/i&gt;.</description>
		<content:encoded><![CDATA[<p>If you can alternate rolls and flips (say), you can arrange for any single mattress to have all of its orientations visited.</p>
<p>I do not understand Tim Knoll&#8217;s description, exactly&#8230;  But his idea is sound.  If you simply have a &#8220;ring&#8221; of two or more beds, and you roll each mattress as it enters bed 1 and flip it as it exits bed 1, then obviously each mattress will visit every possible orientation (because its own sequence of rolls and flips will alternate as it keeps passing through bed 1).</p>
<p>However, if you consider the <b>combination</b> of mattress orientation <b>and</b> bed number as the &#8220;state&#8221; of the mattress, then at least half of the total states will never be visited.   In my example, for instance, &#8220;mattress A on bed 1&#8243; will only be seen in half of the possible orientations.  I do not believe this can be fixed without introducing memory into the protocol (or marking the mattresses). </p>
<p>This claim is not too hard to prove&#8230;  Without memory, any rule involving moving mattresses among multiple beds reduces to a set of disjoint &#8220;rings&#8221; (cycles), where each bed has a fixed &#8220;next bed&#8221; and a fixed &#8220;next mattress operation&#8221; (I, R, P, or Y).  Again, if you focus on a single mattress and a single bed, you can easily show it can only reach half of the possible orientations <i>on that bed</i>.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Paul Topping</title>
		<link>http://bit-player.org/2010/a-double-flip#comment-2698</link>
		<dc:creator>Paul Topping</dc:creator>
		<pubDate>Wed, 17 Mar 2010 17:47:13 +0000</pubDate>
		<guid isPermaLink="false">http://bit-player.org/?p=598#comment-2698</guid>
		<description>Not sure about multiple beds but I thought the flipping scheme was pretty simple for a single bed. There are only 4 possible places for ones head to go on a two-sided, two-ended bed. Just mark each of these with the names of the seasons and when each season starts place the end with its name where you would like your head to be. If you miss a season, it all gets back in sync next season. Save your group theory for a tougher problem. ;-)</description>
		<content:encoded><![CDATA[<p>Not sure about multiple beds but I thought the flipping scheme was pretty simple for a single bed. There are only 4 possible places for ones head to go on a two-sided, two-ended bed. Just mark each of these with the names of the seasons and when each season starts place the end with its name where you would like your head to be. If you miss a season, it all gets back in sync next season. Save your group theory for a tougher problem. ;-)</p>
]]></content:encoded>
	</item>
</channel>
</rss>

