<?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: Roadmap</title>
	<atom:link href="http://janbogaerts.name/index.php/2009/09/14/roadmap/feed/" rel="self" type="application/rss+xml" />
	<link>http://janbogaerts.name/index.php/2009/09/14/roadmap/</link>
	<description>My take on neural networks, AI and more</description>
	<lastBuildDate>Tue, 04 May 2010 06:43:20 +0000</lastBuildDate>
	<generator>http://wordpress.org/?v=2.9.2</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>By: admin</title>
		<link>http://janbogaerts.name/index.php/2009/09/14/roadmap/comment-page-1/#comment-287</link>
		<dc:creator>admin</dc:creator>
		<pubDate>Wed, 30 Sep 2009 10:19:38 +0000</pubDate>
		<guid isPermaLink="false">http://janbogaerts.name/index.php/2009/09/14/roadmap/#comment-287</guid>
		<description>By the way, I figure that, for humans too, creating the correct shortcuts is actually the tricky part. As usual, there are many ways of doing this, and I suspect most people often take the easiest way for creating those links: simply recording from others, which is probably how I will be doing it initially.</description>
		<content:encoded><![CDATA[<p>By the way, I figure that, for humans too, creating the correct shortcuts is actually the tricky part. As usual, there are many ways of doing this, and I suspect most people often take the easiest way for creating those links: simply recording from others, which is probably how I will be doing it initially.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Jan</title>
		<link>http://janbogaerts.name/index.php/2009/09/14/roadmap/comment-page-1/#comment-286</link>
		<dc:creator>Jan</dc:creator>
		<pubDate>Wed, 30 Sep 2009 07:42:26 +0000</pubDate>
		<guid isPermaLink="false">http://janbogaerts.name/index.php/2009/09/14/roadmap/#comment-286</guid>
		<description>Yes, this is actually the easy part, it&#039;s mimicing the less intelligent behaviour of humanity: simply recording events from the outside world and replaying them without interpretation (you would not believe how common this behaviour is and how often we do this).  In fact, this is already (partly) implemented, in the scanner demo. I think the &#039;understanding&#039; as we know it, is nothing more than the recognition of a set of flows and/or frames, which is what the scanner demo does. To get the processing time down, it also uses a lot of shortcuts, which are defined on the flow items. For instance, in the flow definition, an integer is defined as a sequence of digits without anything in between, while a double (float) is defined as a sequence of digits, followed by a [ , &#124; . ] followed by a number of digits again. Recognising this in the input, causes a LOT of splits (each digit has 3 possible paths: for an int, the front of a double or the back of a double, so 3 splits for each digit). Some are required, for instance, the point doesn&#039;t know if it&#039;s the end of a sentence that has an int at the end, or if it is the middle of a float, so it creates a split that will be resolved once the section after the point is interpreted. But the second series of digits in a float for instance, they know exactly what they are, since the first digits and point have already been found, so the shortcut says that there is no split required for this, but instead it instructs the algorithm to take the path that says it&#039;s the end of a float. This idea can be used on any kind of flow/frame, using the same already implemented algorithm (only the flows and the shortcuts need to be defined).  
Auto creation of the shortcuts is the hard part, since &#039;new&#039; links need to be created for this, based on the interpretation of already existing links, through an alghorithm.  This hasn&#039;t been programmed yet. I think it requires a new algorithm, that compares the new imput and it&#039;s surrounding variables with something else. the output of this algorithm would be a series of new links that form the shortcut.</description>
		<content:encoded><![CDATA[<p>Yes, this is actually the easy part, it&#8217;s mimicing the less intelligent behaviour of humanity: simply recording events from the outside world and replaying them without interpretation (you would not believe how common this behaviour is and how often we do this).  In fact, this is already (partly) implemented, in the scanner demo. I think the &#8216;understanding&#8217; as we know it, is nothing more than the recognition of a set of flows and/or frames, which is what the scanner demo does. To get the processing time down, it also uses a lot of shortcuts, which are defined on the flow items. For instance, in the flow definition, an integer is defined as a sequence of digits without anything in between, while a double (float) is defined as a sequence of digits, followed by a [ , | . ] followed by a number of digits again. Recognising this in the input, causes a LOT of splits (each digit has 3 possible paths: for an int, the front of a double or the back of a double, so 3 splits for each digit). Some are required, for instance, the point doesn&#8217;t know if it&#8217;s the end of a sentence that has an int at the end, or if it is the middle of a float, so it creates a split that will be resolved once the section after the point is interpreted. But the second series of digits in a float for instance, they know exactly what they are, since the first digits and point have already been found, so the shortcut says that there is no split required for this, but instead it instructs the algorithm to take the path that says it&#8217;s the end of a float. This idea can be used on any kind of flow/frame, using the same already implemented algorithm (only the flows and the shortcuts need to be defined).<br />
Auto creation of the shortcuts is the hard part, since &#8216;new&#8217; links need to be created for this, based on the interpretation of already existing links, through an alghorithm.  This hasn&#8217;t been programmed yet. I think it requires a new algorithm, that compares the new imput and it&#8217;s surrounding variables with something else. the output of this algorithm would be a series of new links that form the shortcut.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Stijn Gysemans</title>
		<link>http://janbogaerts.name/index.php/2009/09/14/roadmap/comment-page-1/#comment-285</link>
		<dc:creator>Stijn Gysemans</dc:creator>
		<pubDate>Wed, 30 Sep 2009 04:54:55 +0000</pubDate>
		<guid isPermaLink="false">http://janbogaerts.name/index.php/2009/09/14/roadmap/#comment-285</guid>
		<description>Jan this is working out really great.
A while ago I was reading the book about Persuasion of humans (http://www.amazon.com/Influence-Psychology-Persuasion-Robert-Cialdini/dp/0688128165). The author presented a psychological idea that people use too make decisions. We do not rationally evaluate all the steps of a possible decision tree but instead we try to find a short cut based upon a certain trigger. 
E.g you see an expensive product and immediately associate this with &quot;good&quot;: overtime, through experience and teaching, you&#039;ve learned this kind of shortcuts because they often prove to be really valuable. (of course, marketing people can misuse this trick by raising the price of an item and hence making it more &#039;qualitative&#039;).

couldn&#039;t you implement this kind of algorithm that scans the whole stack of possibilities and limits the amounts of current treads by eliminating some paths? What you&#039;ll end up is a more boring engine but one that is predictable and faster</description>
		<content:encoded><![CDATA[<p>Jan this is working out really great.<br />
A while ago I was reading the book about Persuasion of humans (<a href="http://www.amazon.com/Influence-Psychology-Persuasion-Robert-Cialdini/dp/0688128165" rel="nofollow">http://www.amazon.com/Influence-Psychology-Persuasion-Robert-Cialdini/dp/0688128165</a>). The author presented a psychological idea that people use too make decisions. We do not rationally evaluate all the steps of a possible decision tree but instead we try to find a short cut based upon a certain trigger.<br />
E.g you see an expensive product and immediately associate this with &#8220;good&#8221;: overtime, through experience and teaching, you&#8217;ve learned this kind of shortcuts because they often prove to be really valuable. (of course, marketing people can misuse this trick by raising the price of an item and hence making it more &#8216;qualitative&#8217;).</p>
<p>couldn&#8217;t you implement this kind of algorithm that scans the whole stack of possibilities and limits the amounts of current treads by eliminating some paths? What you&#8217;ll end up is a more boring engine but one that is predictable and faster</p>
]]></content:encoded>
	</item>
</channel>
</rss>
