<?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: La règle de Tronche de distinction du logiciel</title>
	<atom:link href="http:///blog/2006/07/14/tronches-software-separability-criterion/feed/" rel="self" type="application/rss+xml" />
	<link>/blog/2006/07/14/tronches-software-separability-criterion/</link>
	<description>Mes pensées afin que je ne les oublie pas...</description>
	<lastBuildDate>Wed, 24 Feb 2010 23:11:35 +0000</lastBuildDate>
	<generator>http://wordpress.org/?v=2.9.2</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>By: Frederik Hertzum</title>
		<link>/blog/2006/07/14/tronches-software-separability-criterion/comment-page-1/#comment-910</link>
		<dc:creator>Frederik Hertzum</dc:creator>
		<pubDate>Sat, 11 Feb 2012 23:06:00 +0000</pubDate>
		<guid isPermaLink="false">http://tronche.com/blog/2006/07/14/tronches-software-separability-criterion/#comment-910</guid>
		<description>Your test still holds some problems -- it&#039;s good and will likely be enough for most cases. I propose instead that a different approach can be taken. It is more complex, but I don&#039;t think you can make a good seperation between patentable and non-patentable machines without at least some complexity.

First of all you have to acknowledge that a program (software) is a machine. it is not all that different from any other machine, except that the reality it exists in is different and thus it plays by different rules.

Machines that are not software, are hardware and can not be used in hardware. Machines that are not hardware are software and can not be used without hardware.

Now, to test if a machine is patentable you simple ask if it requires hardware. If it does, then (since it&#039;s software), it&#039;s non-patentable. Any piece of hardware that requires another piece of hardware to do it&#039;s thing is still patentable, because it doesn&#039;t really require hardware to do anything -- it just requires hardware to do the one (or more) right thing(s):

You should note that human minds are machines according to this context, and so anything that can be passed as software should also fit in our mind (since the mind can solve any turing problem it should hold true for any real software) -- so it should be enough to be able to solve a given problem in our minds to  prove that a machine is not patentable.</description>
		<content:encoded><![CDATA[<p>Your test still holds some problems &#8212; it&#8217;s good and will likely be enough for most cases. I propose instead that a different approach can be taken. It is more complex, but I don&#8217;t think you can make a good seperation between patentable and non-patentable machines without at least some complexity.</p>
<p>First of all you have to acknowledge that a program (software) is a machine. it is not all that different from any other machine, except that the reality it exists in is different and thus it plays by different rules.</p>
<p>Machines that are not software, are hardware and can not be used in hardware. Machines that are not hardware are software and can not be used without hardware.</p>
<p>Now, to test if a machine is patentable you simple ask if it requires hardware. If it does, then (since it&#8217;s software), it&#8217;s non-patentable. Any piece of hardware that requires another piece of hardware to do it&#8217;s thing is still patentable, because it doesn&#8217;t really require hardware to do anything &#8212; it just requires hardware to do the one (or more) right thing(s):</p>
<p>You should note that human minds are machines according to this context, and so anything that can be passed as software should also fit in our mind (since the mind can solve any turing problem it should hold true for any real software) &#8212; so it should be enough to be able to solve a given problem in our minds to  prove that a machine is not patentable.</p>
]]></content:encoded>
	</item>
</channel>
</rss>

